论文信息 - The Unsolvability of the Recognition of Linear Context-Free Languages - 字舞流文

The Unsolvability of the Recognition of Linear Context-Free Languages

The problem of whether a given context-free language is linear is shown to be recursively undecidable.

Sheila A. Greibach | S. Greibach

[1] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .

[2] S. Ginsburg,et al. Finite-Turn Pushdown Automata , 1966 .

[3] Noam Chomsky,et al. On Certain Formal Properties of Grammars , 1959, Inf. Control..

[4] Sheila A. Greibach,et al. The Undecidability of the Ambiguity Problem for Minimal Linear Grammars , 1963, Inf. Control..

[5] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[6] Robert W. Floyd,et al. On ambiguity in phrase structure languages , 1962, CACM.

[7] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.