TY - GEN A1 - Priese, Lutz T1 - Finite automata on unranked and unordered DAGs N2 - 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. T3 - Arbeitsberichte, FB Informatik - 2007,22 KW - finite state automata KW - directed acyclic graphs KW - regular dag languages KW - finite state automata KW - directed acyclic graphs KW - regular dag languages Y1 - 2007 UR - https://kola.opus.hbz-nrw.de/frontdoor/index/index/docId/131 UR - https://nbn-resolving.org/urn:nbn:de:kola-1311 ER -