×

A strong pumping lemma for context-free languages. (English) Zbl 0359.68091


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aho, A. V.; Ullman, J. D., The Theory of Parsing, Translation and Compiling 1: Parsing (1972), Prentice-Hall: Prentice-Hall Englewood Cliffs · Zbl 0264.68032
[2] Bar-Hillel, Y., Language and Information (1964), Addison-Wesley: Addison-Wesley Reading · Zbl 0158.24102
[3] Chomsky, N., On certain formal properties of grammars, Information and Control, 2, 137-167 (1959) · Zbl 0088.10801
[4] Ginsburg, S.; Greibach, S., Deterministic context-free languages, Information and Control, 9, 620-648 (1966) · Zbl 0145.00802
[5] van Leeuwen, J., A generalization of Parikh’s Theorem in formal language theory, Springer Lecture Notes in Computer Science. Springer Lecture Notes in Computer Science, Proc. 2nd Colloq. on Automata, Languages and Programming, 14, 17-26 (1974) · Zbl 0297.68062
[6] Ogden, W., A helpful result for proving inherent ambiguity, Math. Systems Theory, 2, 191-194 (1968) · Zbl 0175.27802
[7] Parikh, R. J., On context-free languages, J. Assoc. Comput. Mach., 13, 570-581 (1966) · Zbl 0154.25801
[8] Moore, E. F., Sequential Machines (1964), Addison-Wesley: Addison-Wesley Reading · Zbl 0154.00706
[9] Salomaa, A., Formal Languages (1973), Academic Press: Academic Press New York · Zbl 0262.68025
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.