AN INFINITE HIERARCHY OF CONTEXT-FREE LANGUAGES

被引：61

作者：

GREIBACH, SA

机构：

来源：

关键词：

D O I：

10.1145/321495.321503

中图分类号：

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

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：91 / &

共 23 条

[1]

BANERJI RB, 1963, INFORM CONTR, V16, P153

[2]

Bar-Hillel Yehoshua, 1961, SPRACHTYPOLOGIE UNIV, V14, P143

[3]

CHOMSKY N, 1962, MIT65 RES LAB EL QUA

[4]

COLE SN, 1964, THESIS HARVARD U

[5]

Evey R.James., 1963, THESIS HARVARD U

[6] TURING MACHINES WITH RESTRICTED MEMORY ACCESS [J].

FISCHER, PC .

INFORMATION AND CONTROL, 1966, 9 (04) :364-&

[7] 1-WAY STACK AUTOMATA [J].

GINSBURG, S ;

GREIBACH, SA ;

HARRISON, MA .

[8] BOUNDED ALGOL-LIKE LANGUAGES [J].

GINSBURG, S ;

SPANIER, EH .

[9] DETERMINISTIC CONTEXT FREE LANGUAGES [J].

GINSBURG, S ;

GREIBACH, S .

INFORMATION AND CONTROL, 1966, 9 (06) :620-&

[10]

GINSBURG S, 1966, P AM MATH SOC, V17, P1043