Finite automata with undirected state graphs

DOI10.1007/978-3-319-94631-3_18MaRDI QIDQ5896093zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Andreas Malcher, Christian Schneider

Publication date 30 June 2020

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01905634/file/470153_1_En_18_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Operations on Unambiguous Finite Automata
• State complexity of unambiguous operations on finite automata
• Finite automata on directed graphs
• State complexity of unambiguous operations on deterministic finite automata
• Nondeterminism versus determinism of finite automata over directed acyclic graphs

Cited in

(4)

• Finite automata with undirected state graphs
• Finite automata on directed graphs
• Finite Automata on Unranked and Unordered DAGs
• State complexity of transforming graph-walking automata to halting, returning and reversible

This page was built for publication: Finite automata with undirected state graphs

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