A pumping lemma for deterministic context-free languages (Q1120293): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q124820415, #quickstatements; #temporary_batch_1712286835472 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Two iteration theorems for the LL(k) languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Normal forms of deterministic grammars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198075 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5592246 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Formalization of Transition Diagram Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5678435 / rank | |||
Normal rank | |||
Latest revision as of 14:19, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A pumping lemma for deterministic context-free languages |
scientific article |
Statements
A pumping lemma for deterministic context-free languages (English)
0 references
1989
0 references
Greibach normal form
0 references
left-part theorems
0 references
pumping lemma
0 references
iteration theorem
0 references
deterministic context-free languages
0 references
LR(k) grammars
0 references
