CHARACTERIZATIONS OF PUSHDOWN MACHINES IN TERMS OF TIME-BOUNDED COMPUTERS

被引：182

作者：

COOK, SA

机构：

来源：

JOURNAL OF THE ACM | 1971年 / 18卷 / 01期

关键词：

D O I：

10.1145/321623.321625

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：4 / &

共 14 条

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

AHO, AV ;

HOPCROFT, JE ;

ULLMAN, JD .

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

[2]

COBHAM A, 1964, 1964 P INT C LOG MET, P24

[3]

COLE SN, 1966, 7 ANN S SWITCH AUT T, P53

[4]

COOK SA, 1969, MAY C REC ACM S THEO

[5] AN EFFICIENT CONTEXT-FREE PARSING ALGORITHM [J].

EARLEY, J .

COMMUNICATIONS OF THE ACM, 1970, 13 (02) :94-&

[6] STACK AUTOMATA AND COMPILING [J].

GINSBURG, S ;

GREIBACH, SA ;

HARRISON, MA .

JOURNAL OF THE ACM, 1967, 14 (01) :172-&

[7] 2-WAY PUSHDOWN AUTOMATA [J].

GRAY, JN ;

HARRISON, MA ;

IBARRA, OH .

INFORMATION AND CONTROL, 1967, 11 (1-2) :30-&

[8] MULTI-TAPE AND MULTI-HEAD PUSHDOWN AUTOMATA [J].

HARRISON, MA ;

IBARRA, OH .

INFORMATION AND CONTROL, 1968, 13 (05) :433-&

[9] ON COMPUTATIONAL COMPLEXITY OF ALGORITHMS [J].

HARTMANIS, J ;

STEARNS, RE .

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1965, 117 (05) :285-+

[10] 2-TAPE SIMULATION OF MULTITAPE TURING MACHINES [J].

HENNIE, FC ;

STEARNS, RE .

JOURNAL OF THE ACM, 1966, 13 (04) :533-&

← 1 2 →