Dana Angluin (1982):
Inference of reversible languages.
J. ACM 29(3),
pp. 741–765,
doi:10.1145/322326.322334.
Charles H. Bennett (1973):
Logical reversibility of Computation.
IBM J. Res. Dev. 17,
pp. 525–532,
doi:10.1147/rd.176.0525.
Alberto Bertoni & Marco Carpentieri (2001):
Regular Languages Accepted by Quantum Automata.
Inf. Comput. 165,
pp. 174–182,
doi:10.1006/inco.2000.2911.
Luca Breveglieri, Alessandra Cherubini, Claudio Citrini & Stefano Crespi-Reghizzi (1996):
Multi-Push-Down Languages and Grammars.
Int. J. Found. Comput. Sci. 7(3),
pp. 253–292,
doi:10.1142/S0129054196000191.
Patrick C. Fischer, Albert R. Meyer & Arnold L. Rosenberg (1968):
Counter Machines and Counter Languages.
Math. Systems Theory 2,
pp. 265–283,
doi:10.1007/BF01694011.
Sheila A. Greibach (1976):
Remarks on the Complexity of Nondeterministic Counter Languages.
Theor. Comput. Sci. 1(4),
pp. 269–288,
doi:10.1016/0304-3975(76)90072-4.
Juris Hartmanis & John E. Hopcroft (1970):
What makes Some Language Theory Problems Undecidable.
J. Comput. Syst. Sci. 4,
pp. 368–376,
doi:10.1016/S0022-0000(70)80018-6.
Mika Hirvensalo (2010):
Quantum Automata with Open Time Evolution.
Int. J. Nat. Comput. Res. 1,
pp. 70–85,
doi:10.4018/jncr.2010010104.
Markus Holzer, Sebastian Jakobi & Martin Kutrib (2018):
Minimal Reversible Deterministic Finite Automata.
Int. J. Found. Comput. Sci. 29(2),
pp. 251–270,
doi:10.1142/S0129054118400063.
John E. Hopcroft & Jeffrey D. Ullman (1979):
Introduction to Automata Theory, Languages, and Computation.
Addison-Wesley,
Reading, Massachusetts.
Attila Kondacs & John Watrous (1997):
On the Power of Quantum Finite State Automata.
In: FOCS 1997.
IEEE Computer Society,
pp. 66–75,
doi:10.1109/SFCS.1997.646094.
Martin Kutrib & Andreas Malcher (2012):
Reversible Pushdown Automata.
J. Comput. Syst. Sci. 78(6),
pp. 1814–1827,
doi:10.1016/j.jcss.2011.12.004.
Richard Laing (1967):
Realization and complexity of commutative events.
Technical Report 03105-48-T.
University of Michigan.
Giovanna J. Lavado, Giovanni Pighizzini & Luca Prigioniero (2017):
Minimal and Reduced Reversible Automata.
J. Autom. Lang. Comb. 22(1-3),
pp. 145–168,
doi:10.25596/jalc-2017-145.
Giovanna J. Lavado & Luca Prigioniero (2019):
Concise Representations of Reversible Automata.
Int. J. Found. Comput. Sci. 30(6-7),
pp. 1157–1175,
doi:10.1142/S0129054119400331.
Yves Lecerf (1963):
Logique Mathématique: Machines de Turing réversible.
C. R. Séances Acad. Sci. 257,
pp. 2597–2600.
Ming Li & Paul M. B. Vitányi (1993):
An Introduction to Kolmogorov Complexity and Its Applications.
Springer,
doi:10.1007/978-1-4757-3860-5.
Carlo Mereghetti & Beatrice Palano (2021):
Guest Column: Quantum Finite Automata: From Theory to Practice.
SIGACT News 52,
pp. 38–59,
doi:10.1145/3494656.3494666.
Marvin L. Minsky (1961):
Recursive Unsolvability of Post's Problem of `Tag' and Other Topics in the Theory of Turing machines.
Annals of Math. 74,
pp. 437–455,
doi:10.2307/1970290.
Kenichi Morita (1995):
Reversible simulation of one-dimensional irreversible cellular automata.
Theoret. Comput. Sci. 148(1),
pp. 157–163,
doi:10.1016/0304-3975(95)00038-X.
Kenichi Morita (1996):
Universality of a Reversible Two-Counter Machine.
Theor. Comput. Sci. 168,
pp. 303–320,
doi:10.1016/S0304-3975(96)00081-3.
Holger Petersen (2011):
Simulations by Time-Bounded Counter Machines.
Int. J. Found. Comput. Sci. 22,
pp. 395–409,
doi:10.1142/S0129054111008106.
A. C. Cem Say & Abuzer Yakaryılmaz (2014):
Quantum Finite Automata: A Modern Introduction.
In: Cristian S. Calude, Rusins Freivalds & Kazuo Iwama: Computing with New Resources,
LNCS 8808.
Springer,
pp. 208–222,
doi:10.1007/978-3-319-13350-8_16.
Öykü Yilmaz, Firat Kiyak, Meriç Üngör & A. C. Cem Say (2022):
Energy Complexity of Regular Language Recognition.
In: Pascal Caron & Ludovic Mignot: Implementation and Application of Automata (CIAA 2022),
LNCS 13266.
Springer,
pp. 200–211,
doi:10.1007/978-3-031-07469-1_16.
eptcs@eptcs.org