A strong pumping lemma for context-free languages

DOI10.1016/0304-3975(76)90052-9zbMath0359.68091OpenAlexW2087326206WikidataQ124799375 ScholiaQ124799375MaRDI QIDQ1238637

David S. Wise

Publication date: 1977

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90052-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

A pumping lemma for real-time deterministic context-free languages ⋮ The interchange or pump (di)lemmas for context-free languages ⋮ Unnamed Item ⋮ Comparisons of Parikh's condition to other conditions for context-free languages ⋮ Two iteration theorems for the LL(k) languages ⋮ A note on the sufficiency of Sokolowski's criterion for context-free languages ⋮ A simplified proof of Parikh's theorem ⋮ A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES ⋮ Comparisons between some pumping conditions for context-free languages ⋮ On context-free and Szilard languages

Cites Work

• Optimization of LR(k) parsers
• On certain formal properties of grammars
• Deterministic context free languages
• On Context-Free Languages
• A helpful result for proving inherent ambiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A strong pumping lemma for context-free languages