A pumping lemma for real-time deterministic context-free languages (Q1081309): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90032-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987687368 / rank | |||
Normal rank | |||
Revision as of 22:10, 19 March 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
