✦ LIBER ✦

The class of context-free languages is not an EOL family

✍ Scribed by J. Albert; H.A. Maurer

Book ID: 113161933
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 728 KB
Volume: 6
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(77)90066-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

There does not exist an enumerable famil

There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages

✍ K. Yu. Gorbunov 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 458 KB

On the relation between the class of all

On the relation between the class of all context-free languages and the class of deterministic context-free languages

✍ A. Ya. Dikovskii 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 777 KB

On the intersection of the class of line

On the intersection of the class of linear context-free languages and the class of single-reset languages

✍ Klaus W. Wagner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 318 KB

The Set of Minimal Words of a Context-fr

The Set of Minimal Words of a Context-free Language is Context-free

✍ Jean Berstel; L. Boasson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let A be a finite, totally ordered alphabet, and let P be the lexicographic ordering on A\*. Let X be a subset of A\*. The language of minimal words of X is the subset of X composed of the lexicographically minimal word of X for each length: The aim of this paper is to prove that if L is a context-

Permutations are not context-free: An ap

Permutations are not context-free: An application of the interchange lemma

✍ Michael G. Main 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 586 KB

The commutative closure of a binary slip

The commutative closure of a binary slip-language is context-free: a new proof

✍ Michel Rigo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 133 KB