Dana Angluin (1982):
Inference of reversible languages.
Journal of the ACM 29(3),
pp. 741–765,
doi:10.1145/322326.322334.
Charles H. Bennett (1973):
Logical reversibility of computation.
IBM Journal of Research and Development 17(6),
pp. 525–532,
doi:10.1147/rd.176.0525.
Charles H. Bennett (2003):
Notes on Landauer's principle, Reversible Computation and Maxwell's Demon.
Studies in History and Philosophy of Modern Physics 34(3),
pp. 501–510,
doi:10.1016/S1355-2198(03)00039-X.
Jeffrey Bub (2001):
Maxwell's Demon and the Thermodynamics of Computation.
Studies in History and Philosophy of Modern Physics 32(4),
pp. 569–579,
doi:10.1016/S1355-2198(01)00023-5.
John Earman & John D. Norton (1999):
The wrath of Maxwell's demon. Part II. From Szilard to Landauer and beyond.
Studies in History and Philosophy of Modern Physics 30(1),
pp. 1–40,
doi:10.1016/S1355-2198(98)00026-4.
Markus Holzer, Sebastian Jakobi & Martin Kutrib (2015):
Minimal reversible deterministic finite automata.
In: DLT,
Lecture Notes in Computer Science 9168.
Springer,
pp. 276–287,
doi:10.1007/978-3-319-21500-6_22.
John E. Hopcroft & Jeffrey D. Ullman (1979):
Introduction to Automata Theory, Languages and Computation.
Addison-Wesley.
Attila Kondacs & John Watrous (1997):
On the power of quantum finite state automata.
In: FOCS.
IEEE Computer Society,
pp. 66–75.
Martin Kutrib (2014):
Aspects of reversibility for classical automata.
In: Computing with new resources,
Lecture Notes in Computer Science 8808.
Springer,
pp. 83–98,
doi:10.1007/978-3-319-13350-8_7.
Martin Kutrib (2015):
Reversible and irreversible computations of deterministic finite-state devices.
In: MFCS,
Lecture Notes in Computer Science 9234.
Springer,
pp. 38–52,
doi:10.1007/978-3-662-48057-1_3.
James Ladyman, Stuart Presnell, Anthony J. Short & Berry Groisman (2007):
The connection between logical and thermodynamic irreversibility.
Studies in History and Philosophy of Modern Physics 38(1),
pp. 58 – 79,
doi:10.1016/j.shpsb.2006.03.007.
Rolf Landauer (1961):
Irreversibility and heat generation in the computing process.
IBM Journal of Research and Development 5(3),
pp. 183–191,
doi:10.1147/rd.53.0183.
Klaus-Jörn Lange, Pierre McKenzie & Alain Tapp (2000):
Reversible space equals deterministic space.
Journal of Comput. Sys. Sci 60(2),
pp. 354–367,
doi:10.1006/jcss.1999.1672.
Giovanna Lavado, Giovanni Pighizzini & Luca Prigioniero (2017):
Weakly and Strongly Irreversible Regular Languages.
In: AFL.
Giovanna J. Lavado, Giovanni Pighizzini & Luca Prigioniero (2016):
Minimal and Reduced Reversible Automata.
In: Cezar Câmpeanu, Florin Manea & Jeffrey Shallit: Descriptional Complexity of Formal Systems: 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings.
Springer International Publishing,
Cham,
pp. 168–179,
doi:10.1007/978-3-319-41114-9_13.
Sylvain Lombardy (2002):
On the construction of reversible automata for reversible languages.
In: ICALP,
Lecture Notes in Computer Science 2380.
Springer,
pp. 170–182,
doi:10.1007/3-540-45465-9_16.
Michael Nielsen & Isaac Chung (2000):
Quantum computation and quantum information.
Cambridge University Press.
John D. Norton (2005):
Eaters of the lotus: Landauer's principle and the return of Maxwell's demon.
Studies in History and Philosophy of Modern Physics 36,
pp. 375–411,
doi:10.1016/j.shpsb.2004.12.002.
John D. Norton (2011):
Waiting for Landauer.
Studies in History and Philosophy of Modern Physics 42,
pp. 184–198,
doi:10.1016/j.shpsb.2011.05.002.
Jean-Éric Pin (1992):
On reversible automata.
In: LATIN,
Lecture Notes in Computer Science 583.
Springer,
pp. 401–416,
doi:10.1007/BFb0023844.
Joan Vaccaro & Stephen Barnett (2011):
Information Erasure Without an Energy Cost.
Proceedings of the Royal Society A 467(2130),
pp. 1770–1778,
doi:10.1103/PhysRevLett.102.250602.
eptcs@eptcs.org