On the efficient construction of quasi-reversible automata for reversible languages

DOI10.1016/j.ipl.2007.12.004zbMath1186.68255DBLPjournals/ipl/GarciaPL08OpenAlexW2160728288WikidataQ58209344 ScholiaQ58209344MaRDI QIDQ963387

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

zbMATH Keywords

formal languagesquasi-reversible automataresidual finite state automatonreversible language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Quotients and atoms of reversible languages ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Minimal Reversible Deterministic Finite Automata ⋮ Reversible pushdown automata ⋮ On locally reversible languages ⋮ Descriptional complexity of regular languages

Uses Software

• RFSA

Cites Work

• Learning regular languages using RFSAs.
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• A Lower Bound For Reversible Automata
• Inference of Reversible Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the efficient construction of quasi-reversible automata for reversible languages