Minimal and reduced reversible automata

DOI10.25596/JALC-2017-145zbMATH Open1392.68218MaRDI QIDQ4609331FDOQ4609331

Authors: Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero 

Publication date: 29 March 2018

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

zbMATH Keywords

minimal automataregular languagesreversible automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (18)

• Concise representations of reversible automata
• Bideterministic automata and minimal representations of regular languages
• Title not available (Why is that?)
• Minimal and Reduced Reversible Automata
• Title not available (Why is that?)
• Quotients and atoms of reversible languages
• Reversible languages having finitely many reduced automata
• A lower bound for reversible automata
• Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata
• Primitive and irreducible automata
• A small minimal aperiodic reversible Turing machine
• Weakly and Strongly Irreversible Regular Languages
• Reversible pushdown transducers
• Title not available (Why is that?)
• Descriptional complexity of regular languages
• Title not available (Why is that?)
• Minimal reversible deterministic finite automata
• Minimal reversible deterministic finite 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)