FSA supports the production of C++ code on the basis of a finite automaton. Before the automaton is translated into C++ code, it is determinized. In the case of transducers, Mohri's determinization algorithm is applied. Note however that certain transductions cannot be determinized: in that case the algorithm will not terminate.
Further documentation: refer to the fsa_fl module.