Finite Automata on Unranked and Unordered DAGs

DOI10.1007/978-3-540-73208-2_33zbMath1202.68237OpenAlexW2122646129MaRDI QIDQ5428246

Lutz Priese

Publication date: 28 November 2007

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_33

zbMATH Keywords

directed acyclic graphsfinite state automataregular dag languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Language theoretic properties of regular DAG languages

This page was built for publication: Finite Automata on Unranked and Unordered DAGs