State complexity of reversals of deterministic finite automata with output

DOI10.1007/978-3-319-94812-6_12MaRDI QIDQ1616967zbMATH OpenOpenAlexFDO

Authors Sylvie Davies

Publication date 7 November 2018

Full work available at URL https://arxiv.org/abs/1705.07150

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the state complexity of reversals of regular languages
• On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
• State complexity of unambiguous operations on deterministic finite automata
• The state complexity of alternating automata
• State complexity of unambiguous operations on finite automata
• State complexity of basic language operations combined with reversal
• scientific article; zbMATH DE number 1870550
• Deterministic Input-Reversal and Input-Revolving Finite Automata
• scientific article; zbMATH DE number 1962776
• State complexity of operations on input-driven pushdown automata

Cited in

(3)

• On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
• On the state complexity of reversals of regular languages
• State complexity of transforming graph-walking automata to halting, returning and reversible

This page was built for publication: State complexity of reversals of deterministic finite automata with output

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