A Lower Bound For Reversible Automata
RAIRO-Theor. Inf. Appl., 34 5 (2000) 331-341
Published online: 2002-04-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Quotients and atoms of reversible languages
Hellis TammTheoretical Computer Science (2022)
https://doi.org/10.1016/j.tcs.2022.02.023
Reversibility of computations in graph-walking automata
Michal Kunc and Alexander OkhotinInformation and Computation 275 104631 (2020)
https://doi.org/10.1016/j.ic.2020.104631
Minimal Reversible Deterministic Finite Automata
Markus Holzer, Sebastian Jakobi and Martin KutribInternational Journal of Foundations of Computer Science 29 (02) 251 (2018)
https://doi.org/10.1142/S0129054118400063
Mathematical Foundations of Computer Science 2015
Martin KutribLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2015 9234 38 (2015)
https://doi.org/10.1007/978-3-662-48057-1_3
Computing with New Resources
Martin KutribLecture Notes in Computer Science, Computing with New Resources 8808 83 (2014)
https://doi.org/10.1007/978-3-319-13350-8_7
On locally reversible languages
Pedro García, Manuel Vázquez de Parga, Antonio Cano and Damián LópezTheoretical Computer Science 410 (47-49) 4961 (2009)
https://doi.org/10.1016/j.tcs.2009.07.009
On the efficient construction of quasi-reversible automata for reversible languages
Pedro García, Manuel Vázquez de Parga and Damián LópezInformation Processing Letters 107 (1) 13 (2008)
https://doi.org/10.1016/j.ipl.2007.12.004
Automata, Languages and Programming
Sylvain LombardyLecture Notes in Computer Science, Automata, Languages and Programming 2380 170 (2002)
https://doi.org/10.1007/3-540-45465-9_16