The interchange or pump (di)lemmas for context-free languages
From MaRDI portal
Publication:1104760
DOI10.1016/0304-3975(88)90138-7zbMath0647.68074OpenAlexW2083642863WikidataQ125055305 ScholiaQ125055305MaRDI QIDQ1104760
R. Boonyavatana, Giora Slutzki
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90138-7
Related Items (2)
The interchange or pump (di)lemmas for context-free languages ⋮ Comparisons of Parikh's condition to other conditions for context-free languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A pumping lemma for real-time deterministic context-free languages
- The interchange or pump (di)lemmas for context-free languages
- Iteration theorems for families of strict deterministic languages
- Two iteration theorems for the LL(k) languages
- Permutations are not context-free: An application of the interchange lemma
- Two iteration theorems for some families of languages
- A strong pumping lemma for context-free languages
- A method for proving programming languages non context-free
- Optimization of LR(k) parsers
- Linearity is polynomially decidable for realtime pushdown store automata
- An “Interchange Lemma” for Context-Free Languages
- Ogden's lemma for nonterminal bounded languages
- Extensions of sokolowski's theorem to prove languages are not context free or not regular
- A Generalization of Ogden's Lemma
- On the Parsing of Deterministic Languages
- The Unsolvability of the Recognition of Linear Context-Free Languages
- A helpful result for proving inherent ambiguity
- Properties of deterministic top-down grammars
This page was built for publication: The interchange or pump (di)lemmas for context-free languages
