✦ LIBER ✦

Subclasses of deterministic context-free languages

✍ Scribed by A. V. Anisimov

Publisher: Springer US
Year: 1975
Tongue: English
Weight: 369 KB
Volume: 9
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068585

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A subclass of deterministic context-free

A subclass of deterministic context-free languages with a decidable inclusion problem

✍ P. V. Gorshkov; A. B. Stavrovskii 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 693 KB

Subclasses of Linear Context—Free Langua

Subclasses of Linear Context—Free Languages and Homomorphic Characterizations of Languages

✍ Satoshi Okawa; Sadaki Hirose 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 618 KB

A hierarchy of deterministic context-fre

A hierarchy of deterministic context-free ω-languages

✍ J. Duparc 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 386 KB

The inclusion problem for some subclasse

The inclusion problem for some subclasses of context-free languages

✍ Peter R.J. Asveld; Anton Nijholt 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 131 KB

By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the inclusion problem for unambiguous context-free grammars is undecidable. The argument or some straightforward modiÿcation also applies to some other subclasses of context-free languages such as linear

A pumping lemma for real-time determinis

A pumping lemma for real-time deterministic context-free languages

✍ Yoshihide Igarashi 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 569 KB

A graph-based regularity test for determ

A graph-based regularity test for deterministic context-free languages

✍ Priti Shankar; B.S. Adiga 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 550 KB