Finite automata on directed graphs
Journal of Computer and System Sciences
A Kleene theorem for a class of planar acyclic graphs
Information and Computation
Automata Theory on Trees and Partial Orders
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Regular Sets of Pomsets with Autoconcurrency
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A representation of graphs by algebraic expressions and its use for graph rewriting systems
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Closure properties and decision problems of dag automata
Information Processing Letters
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Automata and logics for unranked and unordered trees
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Some examples of semi-rational DAG languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
| Hi-index | 0.00 |
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.