✦ LIBER ✦

The Unsolvability of the Recognition of Linear Context-Free Languages

✍ Scribed by Greibach, Sheila A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Unsolvability of the Recognition of

✍ Review by: Seymour Ginsburg 📂 Article 📅 1971 🏛 Association for Symbolic Logic 🌐 English ⚖ 112 KB

The Boolean closure of linear context-fr

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

On the parallel recognition of unambiguo

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

Efficient parallel recognition of contex

✍ Abhay Jain; N.S. Chaudhari 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 890 KB

A machine realization of the linear cont

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

Ann2algorithm for recognition of context

✍ K. Iordzhev 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 366 KB