On locally reversible languages
From MaRDI portal
Publication:1034616
DOI10.1016/J.TCS.2009.07.009zbMATH Open1194.68136OpenAlexW1968012469WikidataQ58209343 ScholiaQ58209343MaRDI QIDQ1034616FDOQ1034616
Authors: Pedro García, Manuel Vázquez de Parga, Antonio Cano, Damián López 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inference of Reversible Languages
- Title not available (Why is that?)
- Learning regular languages using RFSAs.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Biprefix codes, inverse semigroups and syntactic monoids of injective automata
- Title not available (Why is that?)
- On free inverse monoid languages
- A lower bound for reversible automata
- On the efficient construction of quasi-reversible automata for reversible languages
- Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
- Title not available (Why is that?)
Cited In (10)
- Quantum reversible fuzzy grammars
- Title not available (Why is that?)
- Reversible pushdown automata
- Closure under reversal of languages over infinite alphabets
- Aspects of reversibility for classical automata
- Information symmetries in irreversible processes
- Transducing reversibly with finite state machines
- Quotients and Atoms of Reversible Languages
- Local languages and the Berry-Sethi algorithm
- Reversible regular languages: logical and algebraic characterisations
Uses Software
This page was built for publication: On locally reversible languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034616)
