FOOLING A 2-WAY AUTOMATION OR ONE PUSHDOWN STORE IS BETTER THAN ONE COUNTER FOR 2-WAY MACHINES

被引:24
作者
DURIS, P [1 ]
GALIL, Z [1 ]
机构
[1] TEL AVIV UNIV, SCH MATH SCI, TEL AVIV, ISRAEL
关键词
D O I
10.1016/0304-3975(82)90087-1
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:39 / 53
页数:15
相关论文
共 16 条
[1]  
Blum M., 1978, 19th Annual Symposium on Foundations of Computer Science, P132, DOI 10.1109/SFCS.1978.30
[2]  
BUDACH L, UNPUB AUTOMATA LABYR
[3]  
CHAN T, 1980, THESIS CORNELL U
[4]  
Cobham A., 1966, 7 ANN S SWITCHING AU, P78
[5]   CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS [J].
COOK, SA .
JOURNAL OF THE ACM, 1971, 18 (01) :4-&
[6]  
GALIL Z, 1977, MATH SYST THEORY, V10, P211
[7]  
Hartmanis J., 1972, Acta Informatica, V1, P336, DOI 10.1007/BF00289513
[8]  
Hopcroft J.E., 1969, FORMAL LANGUAGES THE
[9]  
Ibarra O. H., 1973, Journal of Computer and System Sciences, V7, P28, DOI 10.1016/S0022-0000(73)80048-0
[10]  
IBARRA OH, 1980, 8017 U MINN COMP SCI