Language theoretic properties of regular DAG languages

DOI10.1016/J.IC.2017.07.011zbMath1430.68139OpenAlexW2781361501WikidataQ128449829 ScholiaQ128449829MaRDI QIDQ2272978

Johannes Blum, Frank Drewes

Publication date: 17 September 2019

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2017.07.011

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Hyperedge replacement: grammars and languages
• Closure properties and decision problems of dag automata
• Nondeterminism versus determinism of finite automata over directed acyclic graphs
• Properties of Regular DAG Languages
• Structurally Cyclic Petri Nets
• Parallel and two-way automata on directed ordered acyclic graphs
• Handbook of Graph Grammars and Computing by Graph Transformation
• Applications of Weighted Automata in Natural Language Processing
• Finite Automata on Unranked and Unordered DAGs

This page was built for publication: Language theoretic properties of regular DAG languages