A pumping lemma for real-time deterministic context-free languages

DOI10.1016/0304-3975(85)90032-5zbMath0601.68050OpenAlexW1987687368WikidataQ124841187 ScholiaQ124841187MaRDI QIDQ1081309

Yoshihide Igarashi

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90032-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

The interchange or pump (di)lemmas for context-free languages ⋮ Reversible pushdown transducers

Cites Work

• Iteration theorems for families of strict deterministic languages
• Two iteration theorems for the LL(k) languages
• Two iteration theorems for some families of languages
• A strong pumping lemma for context-free languages
• Strict deterministic grammars
• A Generalization of Ogden's Lemma
• On the Parsing of Deterministic Languages
• Deterministic context free languages
• A helpful result for proving inherent ambiguity
• Real-Time Strict Deterministic Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A pumping lemma for real-time deterministic context-free languages