A pumping lemma for real-time deterministic context-free languages (Q1081309): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q124841187, #quickstatements; #temporary_batch_1711196317277 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q124841187 / rank | |||
Normal rank |
Revision as of 14:35, 23 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