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 Journal of Research and Development 17(6),
pp. 525–532,
doi:10.1147/rd.176.0525.
Markus Holzer, Sebastian Jakobi & Martin Kutrib (2015):
Minimal Reversible Deterministic Finite Automata.
In: Igor Potapov: Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings.,
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.
Neil D. Jones (1975):
Space-bounded reducibility among combinatorial problems.
Journal of Computer and System Sciences 11(1),
pp. 68–85,
doi:10.1016/S0022-0000(75)80050-X.
Attila Kondacs & John Watrous (1997):
On the Power of Quantum Finite State Automata..
In: FOCS.
IEEE Computer Society,
pp. 66–75,
doi:10.1109/SFCS.1997.646094.
Martin Kutrib (2015):
Reversible and Irreversible Computations of Deterministic Finite-State Devices.
In: Giuseppe F. Italiano, Giovanni Pighizzini & Donald Sannella: Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I,
Lecture Notes in Computer Science 9234.
Springer,
pp. 38–52,
doi:10.1007/978-3-662-48057-1_3.
Martin Kutrib & Thomas Worsch (2014):
Degrees of Reversibility for DFA and DPDA.
In: Shigeru Yamashita & Shin-ichi Minato: Reversible Computation - 6th International Conference, RC 2014, Kyoto, Japan, July 10-11, 2014. Proceedings,
Lecture Notes in Computer Science 8507.
Springer,
pp. 40–53,
doi:10.1007/978-3-319-08494-7_4.
Rolf W. 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.
J. Comput. Syst. Sci. 60(2),
pp. 354–367,
doi:10.1006/jcss.1999.1672.
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,
Lecture Notes in Computer Science 9777.
Springer,
pp. 168–179,
doi:10.1007/978-3-319-41114-9_13.
An extended version will appear in the Journal of Automata, Languages, and Combinatorics.
Giovanna J. Lavado & Luca Prigioniero (2017):
Concise Representations of Reversible Automata.
In: Giovanni Pighizzini & Cezar Câmpeanu: Descriptional Complexity of Formal Systems - 19th IFIP WG 1.02 International Conference, DCFS 2017, Milano, Italy, July 3-5, 2017, Proceedings,
Lecture Notes in Computer Science 10316.
Springer,
pp. 238–249,
doi:10.1007/978-3-319-60252-3_19.
Sylvain Lombardy (2002):
On the Construction of Reversible Automata for Reversible Languages.
In: Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz & Ricardo Conejo: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings,
Lecture Notes in Computer Science 2380.
Springer,
pp. 170–182,
doi:10.1007/3-540-45465-9_16.
Giovanni Pighizzini (2015):
Investigations on Automata and Languages Over a Unary Alphabet.
Int. J. Found. Comput. Sci. 26(7),
pp. 827–850,
doi:10.1142/S012905411540002X.
Jean-Eric Pin (1992):
On Reversible Automata.
In: Imre Simon: LATIN '92, 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 6-10, 1992, Proceedings,
Lecture Notes in Computer Science 583.
Springer,
pp. 401–416,
doi:10.1007/BFb0023844.
eptcs@eptcs.org