TAPE COMPLEXITY OF DETERMINISTIC CONTEXT-FREE LANGUAGES

被引：83

作者：

SUDBOROUGH, IH

机构：

来源：

关键词：

D O I：

10.1145/322077.322083

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：405 / 414

页数：10

共 29 条

[1]

Aho A.V., 1972, THEORY PARSING TRANS, V1

[2] TIME AND TAPE COMPLEXITY OF PUSHDOWN AUTOMATON LANGUAGES [J].

AHO, AV ;

HOPCROFT, JE ;

ULLMAN, JD .

INFORMATION AND CONTROL, 1968, 13 (03) :186-&

[3]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[4]

Book R. V., 1976, Theoretical Computer Science, V1, P215, DOI 10.1016/0304-3975(76)90057-8

COOK, SA .

[6] OBSERVATION ON TIME-STORAGE TRADE OFF [J].

COOK, SA .

[7]

COOK SA, 1970, 2ND P ANN ACM S THEO, P70

[8]

COOK SA, LINEAR TIME SIMULATI, V1, P75

[9]

FISCHER M, 1969, 1 P S ASS COMP MACH, P181

[10] SYNTACTIC ANALYSIS AND OPERATOR PRECEDENCE [J].

FLOYD, RW .