On locally reversible languages

DOI10.1016/J.TCS.2009.07.009zbMath1194.68136OpenAlexW1968012469WikidataQ58209343 ScholiaQ58209343MaRDI QIDQ1034616

Antonio Cano, Pedro García, Damián López, Manuel Vázquez de Parga

Publication date: 6 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.009

zbMATH Keywords

formal languageslocally reversible languagequasi-\(k\)-reversible automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Aspects of Reversibility for Classical Automata ⋮ Reversible pushdown automata ⋮ Transducing reversibly with finite state machines ⋮ Information symmetries in irreversible processes

Uses Software

• RFSA

Cites Work

• On the efficient construction of quasi-reversible automata for reversible languages
• Biprefix codes, inverse semigroups and syntactic monoids of injective automata
• Learning regular languages using RFSAs.
• Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
• A Lower Bound For Reversible Automata
• On free inverse monoid languages
• Inference of Reversible Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On locally reversible languages