On locally reversible languages
From MaRDI portal
Publication:1034616
DOI10.1016/j.tcs.2009.07.009zbMath1194.68136WikidataQ58209343 ScholiaQ58209343MaRDI QIDQ1034616
Manuel Vázquez de Parga, Pedro García, Damián López, Antonio Cano
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
68Q45: Formal languages and automata
Related Items
Information symmetries in irreversible processes, Reversible pushdown automata, Aspects of Reversibility for Classical Automata
Uses Software
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