A pumping lemma for real-time deterministic context-free languages
type: Item
instance of: scholarly article
title: A pumping lemma for real-time deterministic context-free languages
zbMATH Open document ID: 0601.68050
DOI: 10.1016/0304-3975(85)90032-5
author: Yoshihide Igarashi
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3970125
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90032-5
OpenAlex ID: W1987687368
Wikidata QID: Q124841187
cites work: A Generalization of Ogden's Lemma
cites work: Two iteration theorems for the LL(k) languages
cites work: Two iteration theorems for some families of languages
cites work: Deterministic context free languages
cites work: Q4198075
cites work: Real-Time Strict Deterministic Languages
cites work: Strict deterministic grammars
cites work: On the Parsing of Deterministic Languages
cites work: Q5592246
cites work: Q4181301
cites work: Iteration theorems for families of strict deterministic languages
cites work: Q4072875
cites work: Q3948610
cites work: A helpful result for proving inherent ambiguity
cites work: Q3680301
cites work: A strong pumping lemma for context-free languages
description: scientific article; zbMATH DE number 3970125