✦ LIBER ✦

A Remark on Code Sets and Context-Free Languages

✍ Scribed by Greibach, S.A.

Book ID: 114588349
Publisher: IEEE
Year: 1975
Tongue: English
Weight: 452 KB
Volume: C-24
Category: Article
ISSN: 0018-9340
DOI: 10.1109/t-c.1975.224294

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On ω-sets associated with context-free l

On ω-sets associated with context-free languages

✍ M. Linna 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 845 KB

Test sets for homomorphism equivalence o

Test sets for homomorphism equivalence on context free languages

✍ J. Albert; K. Culik II 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 537 KB

A note on context-free languages

✍ R.F.C. Walters 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 296 KB

A few remarks on the index of context-fr

A few remarks on the index of context-free grammars and languages

✍ J. Gruska 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 324 KB

On context-free and Szilard languages

✍ Erkki Mäkinen 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 395 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-