Abstract
We introduce linear expressions for unrestricted dags (directed acyclic graphs) and finite deterministic and nondeterministic automata operating on them. Those dag automata are a conservative extension of the T u,u-automata of Courcelle on unranked, unordered trees and forests. Several examples of dag languages acceptable and not acceptable by dag automata and some closure properties are given. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Priese, L. (2007). Finite automata on unranked and unordered DAGs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4588 LNCS, pp. 346–360). Springer Verlag. https://doi.org/10.1007/978-3-540-73208-2_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
