NOTE CONCERNING NONDETERMINISTIC TAPE COMPLEXITIES

被引：24

作者：

IBARRA, OH

机构：

来源：

关键词：

D O I：

10.1145/321724.321727

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：608 / &

共 9 条

[1] AFLS AND BOUNDED ERASING [J].

BOOK, RV ;

WEGBREIT, B .

INFORMATION AND CONTROL, 1971, 19 (01) :18-&

[2] STACK AUTOMATA AND COMPILING [J].

GINSBURG, S ;

GREIBACH, SA ;

HARRISON, MA .

[3]

Hartmanis J., 1965, IEEE C REC SWITCH CI, P179

[4]

HOPCROFT J, 1967, JCSS, V1, P166

[5]

Hopcroft J.E., 1969, FORMAL LANGUAGES THE

[6] SOME RESULTS ON TAPE-BOUNDED TURING MACHINES [J].

HOPCROFT, JE ;

ULLMAN, JD .

[7]

Ibarra O. H., 1971, Journal of Computer and System Sciences, V5, P88, DOI 10.1016/S0022-0000(71)80029-6

[8]

RUBY S, 1965, IEEE C RECORD SWITCH, P173

[9]

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]