The Unsolvability of the Recognition of Linear Context-Free Languages

Authors:
Sheila A. Greibach
Affiliations:
System Development Corporation, Santa Monica, California and Harvard University, Cambridge, Massachusetts
Venue:
Journal of the ACM (JACM)
Year:
1966

Citing 2
Cited 7

Operations Which Preserve Definability in Languages

Journal of the ACM (JACM)
On ambiguity in phrase structure languages

Communications of the ACM

An Infinite Hierarchy of Context-Free Languages

Journal of the ACM (JACM)
On the closure properties of linear conjunctive languages

Theoretical Computer Science
On recursive and non-recursive trade-offs between finite-turn pushdown automata

Journal of Automata, Languages and Combinatorics
Ambiguity and decision problems for local adjunct languages

Journal of Computer and System Sciences
Finite-turn checking automata

Journal of Computer and System Sciences
Syntactic operators on full semiAFLs

Journal of Computer and System Sciences
Some non-semi-decidability problems for linear and deterministic context-free languages

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.01

Visualization

Abstract

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