Finite automata on directed graphs

作者:

Highlights:

摘要

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.

论文关键词:

论文评审过程:Received 22 March 1988, Revised 1 August 1990, Available online 2 December 2003.

论文官网地址:https://doi.org/10.1016/0022-0000(92)90012-8