Reversible Limited Automata

A k-limited automaton is a linear bounded automaton that may rewrite each tape square only in the first k visits, where \(k\ge 0\) is a fixed constant. It is known that these automata accept context-free languages only. We investigate deterministic k-limited automata towards their ability to perform reversible computations, that is, computations in which every configuration has at most one predecessor. A first result is that, for all \(k\ge 0\), sweeping k-limited automata accept regular languages only. In contrast to reversible finite automata, all regular languages are accepted by sweeping 0-limited automata. Then we study the computational power gained in the number k of possible rewrite operations. It is shown that the reversible 2-limited automata accept regular languages only and, thus, are strictly weaker than general 2-limited automata. Furthermore, a proper inclusion between reversible 3-limited and 4-limited automata languages is obtained. The next levels of the hierarchy are separated between every k and \(k+3\) rewrite operations. Finally, it turns out that all k-limited automata accept Church-Rosser languages only, that is, the intersection between context-free and Church-Rosser languages contains an infinite hierarchy of language families beyond the deterministic context-free languages.

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

[2]  Carlo Mereghetti,et al.  Complementing two-way finite automata , 2007, Inf. Comput..

[3]  Martin Kutrib,et al.  One-way reversible multi-head finite automata , 2012, Theor. Comput. Sci..

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

[5]  Daniel Prźša.  Weight-Reducing Hennie Machines and Their Descriptional Complexity , 2014, LATA 2014.

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

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

[8]  Kenichi Morita.  A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads , 2012, RC.

[9]  Martin Kutrib,et al.  On Simulation Cost of Unary Limited Automata , 2015, DCFS.

[10]  Paliath Narendran,et al.  Church-Rosser Thue systems and formal languages , 1988, JACM.

[11]  Pierre McKenzie,et al.  Reversible Space Equals Deterministic Space , 2000, J. Comput. Syst. Sci..

[12]  Martin Kutrib,et al.  On Stateless Two-Pushdown Automata and Restarting Automata , 2010, Int. J. Found. Comput. Sci..

[13]  Gerhard Buntrock,et al.  Growing Context-Sensitive Languages and Church-Rosser Languages , 1998, Inf. Comput..

[14]  Giovanni Pighizzini,et al.  Limited Automata and Regular Languages , 2014, Int. J. Found. Comput. Sci..

[15]  Michael Sipser,et al.  Halting space-bounded computations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[16]  Friedrich Otto,et al.  The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages , 2005, Inf. Comput..

[17]  Martin Kutrib,et al.  When Church-Rosser Becomes Context Free , 2007, Int. J. Found. Comput. Sci..

[18]  F. C. Hennie,et al.  One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..

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

[20]  Martin Kutrib,et al.  Degrees of Reversibility for DFA and DPDA , 2014, RC.

[21]  Giovanni Pighizzini,et al.  Limited Automata and Context-Free Languages , 2015, Fundam. Informaticae.

[22]  Thomas N. Hibbard,et al.  A Generalization of Context-Free Determinism , 1967, Inf. Control..

[23]  Martin Kutrib.  Aspects of Reversibility for Classical Automata , 2014, Computing with New Resources.

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

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

[26]  Martin Kutrib,et al.  Reversible Queue Automata , 2016, Fundam. Informaticae.

[27]  Martin Kutrib,et al.  Minimal Reversible Deterministic Finite Automata , 2015, DLT.

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

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

[30]  Juris Hartmanis.  Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.

[31]  John Watrous,et al.  On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.