Iteration theorems for families of strict deterministic languages
From MaRDI portal
Publication:1143811
DOI10.1016/0304-3975(80)90052-3zbMath0442.68073OpenAlexW2009330978WikidataQ127549281 ScholiaQ127549281MaRDI QIDQ1143811
Publication date: 1980
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(80)90052-3
Related Items (4)
A pumping lemma for real-time deterministic context-free languages ⋮ The interchange or pump (di)lemmas for context-free languages ⋮ Two iteration theorems for the LL(k) languages ⋮ On LC(0) grammars and languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two iteration theorems for the LL(k) languages
- Two iteration theorems for some families of languages
- Strict deterministic grammars
- On the Parsing of Deterministic Languages
- Intercalation theorems for stack languages
- A helpful result for proving inherent ambiguity
- Properties of deterministic top-down grammars
- Real-Time Strict Deterministic Languages
This page was built for publication: Iteration theorems for families of strict deterministic languages
