A pumping lemma for real-time deterministic context-free languages (Q1081309)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A pumping lemma for real-time deterministic context-free languages |
scientific article; zbMATH DE number 3970125
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A pumping lemma for real-time deterministic context-free languages |
scientific article; zbMATH DE number 3970125 |
Statements
A pumping lemma for real-time deterministic context-free languages (English)
0 references
1985
0 references
We establish a pumping lemma for real-time deterministic context-free languages. The pumping lemma is useful to prove that a given deterministic context-free language is not real-time. The proving scheme by the pumping lemma is shown by a number of examples.
0 references
