Reversible and Irreversible Computations of Deterministic Finite-State Devices

Finite-state devices with a read-only input tape that may be equipped with further resources as queues or pushdown stores are considered towards their ability to perform reversible computations. Some aspects of the notion of logical reversibility are addressed. We present some selected results on the decidability, uniqueness, and size of minimal reversible deterministic finite automata. The relations and properties of reversible automata that are equipped with storages are discussed, where we exemplarily stick with the storage types queue and pushdown store. In particular, the computational capacities, decidability problems, and closure properties are the main topics covered, and we draw attention to the overall picture and some of the main ideas involved.

[1]  Serafino Amoroso,et al.  Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures , 1972, J. Comput. Syst. Sci..

[2]  Robert Glück,et al.  A Simple and Efficient Universal Reversible Turing Machine , 2011, LATA.

[3]  Franz-Josef Brandenburg,et al.  Intersections of Some Families of Languages , 1986, ICALP.

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

[5]  Jarkko Kari,et al.  Reversibility and Surjectivity Problems of Cellular Automata , 1994, J. Comput. Syst. Sci..

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

[7]  Pierre-Cyrille Héam.  A Lower Bound For Reversible Automata , 2000, RAIRO Theor. Informatics Appl..

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

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

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

[11]  Kenichi Morita,et al.  Reversible Simulation of One-Dimensional Irreversible Cellular Automata , 1995, Theor. Comput. Sci..

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

[13]  Damián López,et al.  On the efficient construction of quasi-reversible automata for reversible languages , 2008, Inf. Process. Lett..

[14]  Roland Vollmar,et al.  Über einen Automaten mit Pufferspeicherung , 1970, Computing.

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

[16]  Jarkko Kari,et al.  Reversible Cellular Automata , 2005, Developments in Language Theory.

[17]  Satoshi Kobayashi,et al.  Learning Approximately Regular Languages with Reversible Languages , 1997, Theor. Comput. Sci..

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

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

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

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

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

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

[24]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[25]  Alessandra Cherubini,et al.  QRT FIFO Automata, Breath-First Grammars and Their Relations , 1991, Theor. Comput. Sci..

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

[27]  Harry Buhrman,et al.  Time and Space Bounds for Reversible Simulation , 2001, ICALP.

[28]  Martin Kutrib,et al.  Real-Time Reversible One-Way Cellular Automata , 2014, Automata.

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

[30]  Charles H. Bennett.  Time/Space Trade-Offs for Reversible Computation , 1989, SIAM J. Comput..

[31]  Luc Longpré,et al.  The Power of the Queue , 1992, SIAM J. Comput..

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

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

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

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

[36]  Martin Kutrib,et al.  Reversible Limited Automata , 2015, MCU.

[37]  Martin Kutrib,et al.  A Hierarchy of Fast Reversible Turing Machines , 2015, RC.

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