Refine
Year of publication
- 2007 (1) (remove)
Document Type
- Part of Periodical (1) (remove)
Keywords
- directed acyclic graphs (1) (remove)
Institute
- Institut für Computervisualistik (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.