A pumping lemma for real-time deterministic context-free languages (Q1081309): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:46, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A pumping lemma for real-time deterministic context-free languages |
scientific article |
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