×

A note on the sufficiency of Sokolowski’s criterion for context-free languages. (English) Zbl 0494.68075


MSC:

68Q45 Formal languages and automata

Citations:

Zbl 0384.68071
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Bar-Hillel, Y.; Perles, M.; Shamir, E., On formal properties of simple phrase structure grammars, Zeitschr, Phonetik, Sprachwiss. und Kommunikationsforsch, 14, 143-172 (1961) · Zbl 0106.34501
[2] Boasson, L., A remark on Ogden’s lemma, EATCS-Bull, 4, 3-4 (1978)
[3] Boasson, L.; Horvath, S., On languages satisfying Ogden’s lemma, RAIRO Inform. Theorique, 12, 201-202 (1978) · Zbl 0387.68054
[4] Ogden, W., A helpful result for proving inherent ambiguity, Math. Systems Theory, 2, 191-197 (1968) · Zbl 0175.27802
[5] Sokolowski, S., A method for proving programming languages non-context-free, Inform. Process. Lett., 7, 3, 151-153 (1978) · Zbl 0384.68071
[6] Wise, D. S., A strong pumping lemma for context-free languages, Theoret. Comput. Sci., 3, 359-369 (1976) · Zbl 0359.68091
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.