Ogden's lemma for nonterminal bounded languages

DOI10.1051/ITA/1986200404571zbMath0631.68065OpenAlexW92423482WikidataQ124809351 ScholiaQ124809351MaRDI QIDQ3768421

R. Boonyavatana, Giora Slutzki

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92271

zbMATH Keywords

context-free grammarChomsky hierarchypumping lemmanonterminal bounded languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

The interchange or pump (di)lemmas for context-free languages ⋮ Ogden's lemma for nonterminal bounded languages ⋮ Comparisons between some pumping conditions for context-free languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of LR(k) parsers
• Linearity is polynomially decidable for realtime pushdown store automata
• Ogden's lemma for nonterminal bounded languages
• The Unsolvability of the Recognition of Linear Context-Free Languages
• A helpful result for proving inherent ambiguity

This page was built for publication: Ogden's lemma for nonterminal bounded languages