FINITE AUTOMATA ON DIRECTED-GRAPHS

被引:4
|
作者
KAMINSKI, M [1 ]
PINTER, SS [1 ]
机构
[1] TECHNION ISRAEL INST TECHNOL,DEPT ELECT ENGN,IL-32000 HAIFA,ISRAEL
关键词
D O I
10.1016/0022-0000(92)90012-8
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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. © 1992.
引用
收藏
页码:425 / 446
页数:22
相关论文
共 50 条