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.
Henning Bordihn & György Vaszil (2021):
Reversible parallel communicating finite automata systems.
Acta Inf. 58(4),
pp. 263–279,
doi:10.1007/s00236-021-00396-9.
Kingshuk Chatterjee & Kumar Sankar Ray (2017):
Reversible Watson-Crick automata.
Acta Inf. 54(5),
pp. 487–499,
doi:10.1007/s00236-016-0267-0.
Kingshuk Chatterjee & Kumar Sankar Ray (2017):
Watson-Crick pushdown automata.
Kybernetika 53(5),
pp. 868–876,
doi:10.14736/kyb-2017-5-0868.
Elena Czeizler, Eugen Czeizler, Lila Kari & Kai Salomaa (2009):
On the descriptional complexity of Watson-Crick automata.
Theor. Comput. Sci. 410,
pp. 3250–3260,
doi:10.1016/j.tcs.2009.05.001.
Rudolf Freund, Gheorghe Păun, Grzegorz Rozenberg & Arto Salomaa (1997):
Watson-Crick Finite Automata.
In: DIMACS Workshop on DNA Based Computers.
University of Pennsylvania,
Philadelphia,
pp. 305–317,
doi:10.1090/dimacs/048/22.
Markus Holzer, Sebastian Jakobi & Martin Kutrib (2018):
Minimal Reversible Deterministic Finite Automata.
Int. J. Found. Comput. Sci. 29,
pp. 251–270,
doi:10.1142/S0129054118400063.
Radim Kocman, Zbynek Krivka, Alexander Meduna & Benedek Nagy (2022):
A jumping 5' → 3' Watson-Crick finite automata model.
Acta Inf. 59(5),
pp. 557–584,
doi:10.1007/s00236-021-00413-x.
Attila Kondacs & John Watrous (1997):
On the Power of Quantum Finite State Automata.
In: Foundations of Computer Science (FOCS 1997).
IEEE Computer Society,
pp. 66–75,
doi:10.1109/SFCS.1997.646094.
Martin Kutrib (2014):
Aspects of Reversibility for Classical Automata.
In: C. S. Calude, G. R. Freivalds & K. Iwama: Computing with New Resources,
LNCS 8808.
Springer,
pp. 83–98,
doi:10.1007/978-3-319-13350-8_7.
Martin Kutrib & Andreas Malcher (2011):
Two-Party Watson-Crick Computations.
In: Implementation and Application of Automata (CIAA 2010),
LNCS 6482.
Springer,
pp. 191–200,
doi:10.1007/978-3-642-18098-9_21.
Martin Kutrib & Andreas Malcher (2012):
Reversible Pushdown Automata.
J. Comput. Syst. Sci. 78,
pp. 1814–1827,
doi:10.1016/j.jcss.2011.12.004.
Martin Kutrib & Andreas Malcher (2017):
One-way reversible multi-head finite automata.
Theor. Comput. Sci. 682,
pp. 149–164,
doi:10.1016/j.tcs.2016.11.006.
Martin Kutrib & Andreas Malcher (2022):
Reversible Computations of One-Way Counter Automata.
In: Henning Bordihn, Géza Horváth & György Vaszil: NCMA 2022,
EPTCS 367,
pp. 126–142,
doi:10.4204/EPTCS.367.9.
Martin Kutrib, Andreas Malcher & Matthias Wendlandt (2016):
Reversible Queue Automata.
Fund. Inform. 148,
pp. 341–368,
doi:10.3233/FI-2016-1438.
Yves Lecerf (1963):
Logique Mathématique: Machines de Turing réversible.
C. R. Séances Acad. Sci. 257,
pp. 2597–2600.
Peter Leupold & Benedek Nagy (2010):
5'3' Watson-Crick Automata with Several Runs.
Fund. Inform. 104,
pp. 71–91,
doi:10.3233/FI-2010-336.
Benedek Nagy (2007):
On 5'3' Sensing Watson-Crick Finite Automata.
In: DNA Computing,
LNCS 4848.
Springer,
pp. 256–262,
doi:10.1007/978-3-540-77962-9_27.
Benedek Nagy (2013):
On a hierarchy of 5' → 3' sensing Watson-Crick finite automata languages.
J. Log. Comput. 23,
pp. 855–872,
doi:10.1093/logcom/exr049.
Benedek Nagy (2020):
5'→3' Watson-Crick pushdown automata.
Inf. Sci. 537,
pp. 452–466,
doi:10.1016/j.ins.2020.06.031.
Benedek Nagy & Zita Kovács (2021):
On deterministic 1-limited sensing 5' → 3' Watson-Crick finite-state transducers.
RAIRO Theor. Informatics Appl. 55,
pp. 5,
doi:10.1051/ita/2021007.
Benedek Nagy, Shaghayegh Parchami & Hamid Mir Mohammad Sadeghi (2017):
A New Sensing 5' → 3' Watson-Crick Automata Concept.
In: Erzsébet Csuhaj-Varjú, Pál Dömösi & György Vaszil: AFL 2017,
EPTCS 252,
pp. 195–204,
doi:10.4204/EPTCS.252.19.
eptcs@eptcs.org