Minimal and reduced reversible automata

DOI10.25596/JALC-2017-145MaRDI QIDQ4609331zbMATH OpenFDO

Authors Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero

Publication date 29 March 2018

zbMATH Keywords

minimal automataregular languagesreversible automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Minimal and Reduced Reversible Automata
• A lower bound for reversible automata
• Reversible languages having finitely many reduced automata
• Minimal reversible deterministic finite automata
• Minimal reversible deterministic finite automata

Cited in

(18)

• scientific article; zbMATH DE number 1870550 (Why is no real title available?)
• Quotients and atoms of reversible languages
• Concise representations of reversible automata
• Weakly and Strongly Irreversible Regular Languages
• Reversible pushdown transducers
• Reversible computations of one-way counter automata
• Reversible languages having finitely many reduced automata
• scientific article; zbMATH DE number 3864507 (Why is no real title available?)
• Minimal and Reduced Reversible Automata
• A lower bound for reversible automata
• Primitive and irreducible automata
• Descriptional complexity of regular languages
• Bideterministic automata and minimal representations of regular languages
• A small minimal aperiodic reversible Turing machine
• scientific article; zbMATH DE number 4020506 (Why is no real title available?)
• Minimal reversible deterministic finite automata
• Minimal reversible deterministic finite automata
• Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata

This page was built for publication: Minimal and reduced reversible automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609331)