Why is there no operation to transduce acceptor FSA by transducer FST?
This is equivalent to composing FSA with FST and then projecting on to the output side. • I built an acceptor/tranducer, but it does not accept/transduce anything! Did you forget to specify the final states? • I can build acceptors fine, but my transducers don’t compile correctly! Did you forget the “-t” flag to fsmcompile, which is needed for transducers? • I can’t print out FSMs with their symbolic labels after calling certain operations on them! Did you include a symbol for label 0, the epilson label, in your symbols file? Certain operations, such as fsmconcat, fsmunion, and fsmclosure can add epsilons to machines that may not have previously contained them. • My determinization never terminates/runs out of memory! Not all FSMs are determinizable; in such cases, determinization will run until resources are exhausted. Sufficient (but not necessary) conditions for an FSM to be determinizable are that it is acyclic or, for acceptors, that it is costless.
Related Questions
- Why is there no operation for converting an acceptor into the corresponding transducer (i.e., the identity transducer restricted to the strings in the acceptor)?
- Why is there no operation to see if a string represented as FSA1 is accepted by an acceptor FSA2?
- Why is there no operation to transduce acceptor FSA by transducer FST?
