One-way reversible multi-head finite automata

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.

[1]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

[2]  Martin Kutrib,et al.  States and Heads Do Count for Unary Multi-head Finite Automata , 2012, Developments in Language Theory.

[3]  Martin Kutrib,et al.  Fast reversible language recognition using cellular automata , 2007, Inf. Comput..

[4]  Andreas Malcher.  Descriptional Complexity of Cellular Automata and Decidability Questions , 2001, DCFS.

[5]  Martin Kutrib,et al.  Real-Time Reversible Iterative Arrays , 2007, FCT.

[6]  Arnold L. Rosenberg.  On multi-head finite automata , 1965, SWCT.

[7]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[8]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[9]  Iain C. C. Phillips,et al.  Reversing algebraic process calculi , 2007, J. Log. Algebraic Methods Program..

[10]  Kenichi Morita,et al.  Two-Way Reversible Multi-Head Finite Automata , 2011, Fundam. Informaticae.

[11]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[12]  Robert Glück,et al.  Reversible Flowchart Languages and the Structured Reversible Program Theorem , 2008, ICALP.

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  Kenichi Morita,et al.  Reversible computing and cellular automata - A survey , 2008, Theor. Comput. Sci..

[15]  Jean-Éric Pin,et al.  On Reversible Automata , 1992, LATIN.

[16]  Tetsuo Yokoyama,et al.  Reversible Computation and Reversible Programming Languages , 2010, RC@ETAPS.

[17]  Juris Hartmanis.  On non-determinancy in simple computing devices , 2004, Acta Informatica.

[18]  Holger Bock Axelsen.  Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space , 2012, LATA.

[19]  Andrew Chi-Chih Yao,et al.  K + 1 heads are better than K , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[20]  Martin Kutrib,et al.  Reversible pushdown automata , 2012, J. Comput. Syst. Sci..