Abstract   Automata on directed acyclic graphs are defined and their closure properties and the emptiness problem are studied. It is shown that several types of finite automata on various structures are special cases of the above automata.
['Michael Kaminski', 'Shlomit S. Pinter']
Finite automata on directed graphs