✦ LIBER ✦

An “Interchange Lemma” for Context-Free Languages

✍ Scribed by Ogden, William; Ross, Rockford J.; Winklmann, Karl

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A pumping lemma for deterministic contex

✍ Sheng Yu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 601 KB

A strong pumping lemma for context-free

✍ David S. Wise 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Permutations are not context-free: An ap

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

A pumping lemma for real-time determinis

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

A shrinking lemma for random forbidding

✍ Andries van der Walt; Sigrid Ewert 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 107 KB

An Infinite Hierarchy of Context-Free La

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