Weakly and Strongly Irreversible Regular Languages

Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages, respectively. The existence of k-reversible languages which are not (k-1)-reversible is known, for each k>1. This gives an infinite hierarchy of weakly irreversible languages, i.e., languages which are k-reversible for some k. Conditions characterizing the class of k-reversible languages, for each fixed k, and the class of weakly irreversible languages are obtained. From these conditions, a procedure that given a finite automaton decides if the accepted language is weakly or strongly (i.e., not weakly) irreversible is described. Furthermore, a construction which allows to transform any finite automaton which is not k-reversible, but which accepts a k-reversible language, into an equivalent k-reversible finite automaton, is presented.

[1]  Sylvain Lombardy.  On the Construction of Reversible Automata for Reversible Languages , 2002, ICALP.

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

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

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

[5]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[6]  Luca Prigioniero,et al.  Minimal and Reduced Reversible Automata , 2016, ICTCS.

[7]  Martin Kutrib,et al.  Minimal Reversible Deterministic Finite Automata , 2018, Int. J. Found. Comput. Sci..

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

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

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

[11]  Luca Prigioniero,et al.  Concise Representations of Reversible Automata , 2017, DCFS.

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

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

[14]  Martin Kutrib.  Reversible and Irreversible Computations of Deterministic Finite-State Devices , 2015, MFCS.

[15]  Giovanni Pighizzini.  Investigations on Automata and Languages Over a Unary Alphabet , 2015, Int. J. Found. Comput. Sci..