A Simple Method for Building Bimachines from Functional Finite-State Transducers
The standard construction of a bimachine from a functional transducer involves a preparation step for converting the transducer into an unambiguous transducer (A transducer is unambiguous if there exists at most one successful path for each label.). The conversion involves a specialized determinization. We introduce a new construction principle where the transducer is directly translated into a bimachine. For any input word accepted by the transducer the bimachine exactly imitates one successful path of the transducer. For some classes of transducers the new construction can build a bimachine with an exponentially lower number of states compared to the standard construction. We first present a simple and generic variant of the construction. A second specialized version leads to better complexity bounds in terms of the size of the bimachine.
KeywordsBimachines Transducers Rational functions
- 1.Berstel, J.: Transductions and Context-Free Languages. Springer Fachmedien Wiesbaden GmbH, Wiesbaden (1979)Google Scholar
- 7.Roche, E., Schabes, Y.: Finite-State Language Processing. MIT Press, Cambridge (1997)Google Scholar
- 8.Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)Google Scholar
- 9.Sakarovitch, J., de Souza, R.: Lexicographic decomposition of k-valued transducers. Theor. Comp. Sys. 47(3), 758–785 (2010). http://dx.doi.org/10.1007/s00224-009-9206-6
- 12.Souza, R.: A note on bimachines. In: 1a Escola de Informática Teórica e Métodos Formais, Natal - RN, pp. 83–92, November 2016Google Scholar