On the efficient construction of quasi-reversible automata for reversible languages
- 30 June 2008
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 107 (1), 13-17
- https://doi.org/10.1016/j.ipl.2007.12.004
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Learning regular languages using RFSAsTheoretical Computer Science, 2004
- A Lower Bound For Reversible AutomataRAIRO - Theoretical Informatics and Applications, 2000
- Inference of Reversible LanguagesJournal of the ACM, 1982