Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: A general theory of translation. Math. Syst. Theor. 3, 193–221 (1969)
Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Parsing, vol. I. Prentice-Hall (1972)
Angluin, D.: Inference of reversible languages. J. ACM 29, 741–765 (1982)
Axelsen, H.B., Jakobi, S., Kutrib, M., Malcher, A.: A hierarchy of fast reversible turing machines. In: Krivine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 29–44. Springer, Cham (2015). doi:10.1007/978-3-319-20860-2_2
Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)
Bensch, S., Björklund, J., Kutrib, M.: Deterministic stack transducers. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 27–38. Springer, Cham (2016). doi:10.1007/978-3-319-40946-7_3
Berstel, J.: Transductions and Context-Free-Languages. Teubner (1979)
Holzer, M., Jakobi, S., Kutrib, M.: Minimal reversible deterministic finite automata. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 276–287. Springer, Cham (2015). doi:10.1007/978-3-319-21500-6_22
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)
Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. System Sci. 78, 1814–1827 (2012)
Kutrib, M., Malcher, A.: One-dimensional cellular automaton transducers. Fundam. Inform. 126, 201–224 (2013)
Kutrib, M., Malcher, A.: One-way reversible multi-head finite automata. Theor. Comput. Sci., to appear
Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961)
Lange, K.J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60, 354–367 (2000)
Lecerf, Y.: Logique mathématique: machines de Turing réversible. C.R. Séances Acad. Sci. 257, 2597–2600 (1963)
Morita, K.: Two-way reversible multi-head finite automata. Fund. Inform. 110, 241–254 (2011)
Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401–416. Springer, Heidelberg (1992). doi:10.1007/BFb0023844
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kutrib, M., Malcher, A., Wendlandt, M. (2017). Transducing Reversibly with Finite State Machines. In: Carayol, A., Nicaud, C. (eds) Implementation and Application of Automata. CIAA 2017. Lecture Notes in Computer Science(), vol 10329. Springer, Cham. https://doi.org/10.1007/978-3-319-60134-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-60134-2_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60133-5
Online ISBN: 978-3-319-60134-2
eBook Packages: Computer ScienceComputer Science (R0)