Apply the transducer to the input, replacing any internal characters with the given string.
Apply the transducer to the input, replacing any internal characters with the given string.
Assumes transducer is functional, so returns the first found output
Calculates regular language that is the post-image of the given regular language.
Calculates regular language that is the post-image of the given regular language. I.e. Post_T(aut) for transducer T. Will fail if the transducer uses the internal char op. and internalApprox is None.
internalApprox will nest the automaton internalApprox whenever an internal transition should have been output.
Calculates regular language that is pre-image of the given regular language.
Calculates regular language that is pre-image of the given regular language. I.e. Pre_T(aut) for transducer T
internal is a map indicating which states should be considered to have an Internal character between them. I.e. map(s) contains s' if there is an internal transition between s and s'
Calculates regular language that is pre-image of the given regular language.
Calculates regular language that is pre-image of the given regular language. I.e. Pre_T(aut) for transducer T
Convenience method for when there are no internal transitions
Return a dot representation of the transducer (may not be implemented)
Return a dot representation of the transducer (may not be implemented)
Implementation of transducers as automata with input and output states. That is, from an input state, all transitions read a character from input. From an output state, all transitions produce a character of output