2-WAY NESTED STACK AUTOMATA ARE EQUIVALENT TO 2-WAY STACK AUTOMATA

被引:7
作者
BEERI, C [1 ]
机构
[1] HEBREW UNIV JERUSALEM,INST MATH,JERUSALEM 91000,ISRAEL
关键词
D O I
10.1016/S0022-0000(75)80004-3
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:317 / 339
页数:23
相关论文
共 9 条
[1]   INDEXED GRAMMARS - AN EXTENSION OF CONTEXT-FREE GRAMMARS [J].
AHO, AV .
JOURNAL OF THE ACM, 1968, 15 (04) :647-&
[2]   NESTED STACK AUTOMATA [J].
AHO, AV .
JOURNAL OF THE ACM, 1969, 16 (03) :383-&
[3]  
BEERI C, 1975, THESIS HEBREW U JERU
[4]   CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS [J].
COOK, SA .
JOURNAL OF THE ACM, 1971, 18 (01) :4-&
[5]   MULTI-TAPE AND MULTI-HEAD PUSHDOWN AUTOMATA [J].
HARRISON, MA ;
IBARRA, OH .
INFORMATION AND CONTROL, 1968, 13 (05) :433-&
[6]  
HOPCROFT J, 1967, JCSS, V1, P166
[7]  
Ibarra O. H., 1971, Journal of Computer and System Sciences, V5, P88, DOI 10.1016/S0022-0000(71)80029-6
[8]  
OGDEN WF, 1968, THESIS STANFORD U
[9]   HALTING STACK AUTOMATA [J].
ULLMAN, JD .
JOURNAL OF THE ACM, 1969, 16 (04) :550-&