A pumping lemma for real-time deterministic context-free languages
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.
scientific article; zbMATH DE number 3970125
scientific article