TALLY LANGUAGES AND COMPLEXITY CLASSES

被引:82
作者
BOOK, RV [1 ]
机构
[1] HARVARD UNIV,CTR RES COMP TECHNOL,CAMBRIDGE,MA 02138
来源
INFORMATION AND CONTROL | 1974年 / 26卷 / 02期
关键词
D O I
10.1016/S0019-9958(74)90473-2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:186 / 193
页数:8
相关论文
共 8 条
[1]  
BOOK R, IN PRESS
[2]  
Book R. V., 1972, SIAM Journal on Computing, V1, P281, DOI 10.1137/0201019
[3]   CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS [J].
COOK, SA .
JOURNAL OF THE ACM, 1971, 18 (01) :4-&
[4]   INTERSECTION-CLOSED FULL AFL AND RECURSIVELY ENUMERABLE LANGUAGES [J].
GINSBURG, S ;
GOLDSTINE, J .
INFORMATION AND CONTROL, 1973, 22 (03) :201-231
[5]  
Hartmanis J., 1972, Acta Informatica, V1, P336, DOI 10.1007/BF00289513
[6]  
HARTMANIS J, 1973, TR73171 CORN U TECHN
[7]  
Savitch W. J., 1973, Acta Informatica, V2, P249, DOI 10.1007/BF00289080
[8]  
Savitch W. J., 1970, J COMPUT SYSTEM SCI, V4, P177, DOI [10.1016/S0022-0000(70)80006-X, DOI 10.1016/S0022-0000(70)80006-X]