Abstract
One-way multi-head finite automata are considered towards their ability to perform reversible computations. It is shown that, for every number k ≥ 1 of heads, there are problems which can be solved by one-way k-head finite automata, but not by any one-way reversible k-head finite automaton. Additionally, a proper head hierarchy is obtained for one-way reversible multi-head finite automata. Finally, decidability problems are considered. It turns out that one-way reversible finite automata with two heads are still a powerful model, since almost all commonly studied problems are not even semidecidable.
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
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Inference of reversible languages. J. ACM 29, 741–765 (1982)
Axelsen, H.B.: Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 95–105. Springer, Heidelberg (2012)
Bennet, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)
Hartmanis, J.: On non-determinancy in simple computing devices. Acta Inform. 1, 336–344 (1972)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)
Kutrib, M., Malcher, A.: Fast reversible language recognition using cellular automata. Inform. Comput. 206, 1142–1151 (2008)
Kutrib, M., Malcher, A.: Real-time reversible iterative arrays. Theoret. Comput. Sci. 411, 812–822 (2010)
Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78, 1814–1827 (2012)
Kutrib, M., Malcher, A., Wendlandt, M.: States and Heads Do Count for Unary Multi-head Finite Automata. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 214–225. Springer, Heidelberg (2012)
Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183–191 (1961)
Malcher, A.: Descriptional complexity of cellular automata and decidability questions. J. Autom., Lang. Comb. 7, 549–560 (2002)
Morita, K.: Reversible computing and cellular automata – A survey. Theoret. Comput. Sci. 395, 101–131 (2008)
Morita, K.: Two-way reversible multi-head finite automata. Fund. Inform. 110, 241–254 (2011)
Phillips, I.C.C., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73, 70–96 (2007)
Pin, J.E.: On Reversible Automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401–416. Springer, Heidelberg (1992)
Rosenberg, A.L.: On multi-head finite automata. IBM J. Res. Dev. 10, 388–394 (1966)
Yao, A.C., Rivest, R.L.: k + 1 heads are better than k. J. ACM 25, 337–340 (1978)
Yokoyama, T.: Reversible computation and reversible programming languages. Electron. Notes Theor. Comput. Sci. 253, 71–81 (2010)
Yokoyama, T., Axelsen, H.B., Glück, R.: Reversible Flowchart Languages and the Structured Reversible Program Theorem. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 258–270. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kutrib, M., Malcher, A. (2013). One-Way Reversible Multi-head Finite Automata. In: Glück, R., Yokoyama, T. (eds) Reversible Computation. RC 2012. Lecture Notes in Computer Science, vol 7581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36315-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-36315-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36314-6
Online ISBN: 978-3-642-36315-3
eBook Packages: Computer ScienceComputer Science (R0)