On the efficient construction of quasi-reversible automata for reversible languages
From MaRDI portal
Publication:963387
DOI10.1016/J.IPL.2007.12.004zbMATH Open1186.68255DBLPjournals/ipl/GarciaPL08OpenAlexW2160728288WikidataQ58209344 ScholiaQ58209344MaRDI QIDQ963387FDOQ963387
Authors: Pedro García, Manuel Vázquez de Parga, Damián López 
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.12.004
Recommendations
Cites Work
- Inference of Reversible Languages
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
- Learning regular languages using RFSAs.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A lower bound for reversible automata
Cited In (9)
- On locally reversible languages
- Title not available (Why is that?)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices
- Reversible pushdown automata
- Minimal Reversible Deterministic Finite Automata
- Quotients and atoms of reversible languages
- Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata
- Quotients and Atoms of Reversible Languages
- Descriptional complexity of regular languages
Uses Software
This page was built for publication: On the efficient construction of quasi-reversible automata for reversible languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963387)
