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

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

zbMATH Keywords

formal languagesquasi-reversible automataresidual finite state automatonreversible language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2086620
• A lower bound for reversible automata
• Concise representations of reversible automata
• Minimal reversible deterministic finite automata
• Quotients and Atoms of Reversible Languages

Cites work

• scientific article; zbMATH DE number 1670711 (Why is no real title available?)
• scientific article; zbMATH DE number 2086220 (Why is no real title available?)
• scientific article; zbMATH DE number 4020506 (Why is no real title available?)
• scientific article; zbMATH DE number 2086620 (Why is no real title available?)
• scientific article; zbMATH DE number 1886068 (Why is no real title available?)
• A lower bound for reversible automata
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• Inference of Reversible Languages
• Learning regular languages using RFSAs.

Cited in

(11)

• Quotients and atoms of reversible languages
• Concise representations of reversible automata
• Reversible pushdown automata
• Quotients and Atoms of Reversible Languages
• Concise representations of reversible automata
• scientific article; zbMATH DE number 2086620 (Why is no real title available?)
• Descriptional complexity of regular languages
• On locally reversible languages
• Reversible and irreversible computations of deterministic finite-state devices
• Minimal reversible deterministic finite automata
• Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata

Describes a project that uses

Uses Software

• RFSA

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)