UNSOLVABILITY OF RECOGNITION OF LINEAR CONTEXT-FREE LANGUAGES

被引：33

作者：

GREIBACH, SA

机构：

来源：

关键词：

D O I：

10.1145/321356.321365

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：582 / &

共 10 条

[1]

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

[2]

BARHILLEL Y, 1965, LANGUAGE INFORMATION, P116

[3]

BRAFFORT P, 1963, COMPUTER PROGRAMM ED, P118

[4]

Chomsky N., 1959, INFORM CONTROL, V2, P137, DOI 10.1016/S0019-9958(59)90362-6

[5]

Chomsky N., 1963, COMPUTER PROGRAMMING, P118

[6] ON AMBIGUITY IN PHRASE STRUCTURE LANGUAGES [J].

FLOYD, RW .

[7] OPERATIONS WHICH PRESERVE DEFINABILITY IN LANGUAGES [J].

GINSBURG, S ;

ROSE, GF .

[8]

GINSBURG S, IN PREPARATION

[9] UNDECIDABILITY OF AMBIGUITY PROBLEM FOR MINIMAL LINEAR GRAMMARS [J].

GREIBACH, SA .

INFORMATION AND CONTROL, 1963, 6 (02) :119-&

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

RABIN, MO ;

SCOTT, D .