Transducing Reversibly with Finite State Machines
Finite state machines are investigated towards their ability to reversibly compute transductions, that is, to transform inputs into outputs in a reversible way. This means that the transducers are backward deterministic and hence are able to uniquely step the computation back and forth. The families of transductions computed are classified with regard to three types of length-preserving transductions as well as to the property of working reversibly. It is possible to settle all inclusion relations between the families of transductions. Finally, the standard closure properties are investigated and the non-closure under almost all operations can be shown.
- 2.Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Parsing, vol. I. Prentice-Hall (1972)Google Scholar
- 7.Berstel, J.: Transductions and Context-Free-Languages. Teubner (1979)Google Scholar
- 9.Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Foundations of Computer Science (FOCS 1997), pp. 66–75. IEEE Computer Society (1997)Google Scholar
- 12.Kutrib, M., Malcher, A.: One-way reversible multi-head finite automata. Theor. Comput. Sci., to appearGoogle Scholar