AN INFINITE HIERARCHY OF CONTEXT-FREE LANGUAGES

被引：61

作者：

GREIBACH, SA

机构：

来源：

关键词：

D O I：

10.1145/321495.321503

中图分类号：

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

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：91 / &

共 23 条

[11]

GINSBURG S, 1966, MATHEMATICAL THEORY

[12]

GINSBURG S, TO BE PUBLISHED

[13]

Ginsburg S., 1966, J SIAM CONTROL, V4, P429

[14]

GREIBACH S, IN PRESS

[15] A NOTE ON PUSHDOWN STORE AUTOMATA AND REGULAR SYSTEMS [J].

GREIBACH, SA .

[16] UNSOLVABILITY OF RECOGNITION OF LINEAR CONTEXT-FREE LANGUAGES [J].

GREIBACH, SA .

GREIBACH, SA .

[18]

HOPCROFT JE, 1967, AT&T TECH J, V46, P1793

[19] A VARIANT OF A RECURSIVELY UNSOLVABLE PROBLEM [J].

POST, EL .

[20] FINITE AUTOMATA AND THEIR DECISION PROBLEMS [J].

RABIN, MO ;

SCOTT, D .