✦ LIBER ✦

The Unsolvability of the Recognition of Linear Context-free Languages.by Sheila A. Greibach

✍ Scribed by Review by: Seymour Ginsburg

Book ID: 124972690
Publisher: Association for Symbolic Logic
Year: 1971
Tongue: English
Weight: 112 KB
Volume: 36
Category: Article
ISSN: 0022-4812
DOI: 10.2307/2272530

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Unsolvability of the Recognition of

The Unsolvability of the Recognition of Linear Context-Free Languages

✍ Greibach, Sheila A. 📂 Article 📅 1966 🏛 Association for Computing Machinery 🌐 English ⚖ 334 KB

The Undecidability of the Ambiguity Prob

The Undecidability of the Ambiguity Problem for Minimal Linear Grammarsby Sheila A. Greibach

✍ Review by: S.-Y. Kuroda 📂 Article 📅 1967 🏛 Association for Symbolic Logic 🌐 English ⚖ 378 KB

A machine realization of the linear cont

A machine realization of the linear context-free languages

✍ Arnold L. Rosenberg 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 629 KB

The Boolean closure of linear context-fr

The Boolean closure of linear context-free languages

✍ Martin Kutrib; Andreas Malcher; Detlef Wotschke 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 321 KB

The Hardest Context-Free Language

✍ Greibach, Sheila A. 📂 Article 📅 1973 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 772 KB

There is a context-free language L0 such that every context-flee language is an inverse homomorphic image of Lo or Lo {e}. Hence the time complexity of recognition of Lo is the least upper bound for time complexity of recognition of context-free languages. A similar result holds for quasirealtime Tu

On the parallel recognition of unambiguo

On the parallel recognition of unambiguous context-free languages

✍ Michal Chytil; Maxime Crochemore; Burkhard Monien; Wojciech Rytter 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 716 KB