Recommendations
Cites work
- scientific article; zbMATH DE number 1670711 (Why is no real title available?)
- scientific article; zbMATH DE number 4020506 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (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?)
- scientific article; zbMATH DE number 6292604 (Why is no real title available?)
- scientific article; zbMATH DE number 3310090 (Why is no real title available?)
- A lower bound for reversible automata
- Biprefix codes, inverse semigroups and syntactic monoids of injective automata
- Inference of Reversible Languages
- Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
- Learning regular languages using RFSAs.
- On free inverse monoid languages
- On the efficient construction of quasi-reversible automata for reversible languages
Cited in
(10)- Reversible pushdown automata
- Closure under reversal of languages over infinite alphabets
- Quotients and Atoms of Reversible Languages
- Local languages and the Berry-Sethi algorithm
- Quantum reversible fuzzy grammars
- Information symmetries in irreversible processes
- Aspects of reversibility for classical automata
- Reversible regular languages: logical and algebraic characterisations
- Transducing reversibly with finite state machines
- scientific article; zbMATH DE number 4001459 (Why is no real title available?)
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)