Refine
Language
- English (1) (remove)
Has Fulltext
- yes (1) (remove)
Keywords
Institute
- Fachbereich 4 (1) (remove)
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 Tu,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.