×

Classes of languages proof against regular pumping. (English) Zbl 0449.68035


MSC:

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

References:

[1] 1. L. BOASSON, Un critère de rationnalité des langages algébriques. In M. NIVAT, Ed., Automata, Languages and Programming, 1972, pp. 359-365. Zbl0263.68038 MR368487 · Zbl 0263.68038
[2] 2. S. HORVÀTH, The Family of Languages Satisfying Bar-Hillel’s Lemma, R.A.I.R.O., Informatique Theorique, Vol. 12, No. 3, 1978, pp. 193-199. Zbl0387.68053 MR510636 · Zbl 0387.68053
[3] 3. J. JAFFE, A Necessary and Sufficient Pumping Lemma for Regular Languages, S.I.G.A.C.T. News summer, 1978, pp. 48-49. Zbl0397.68084 · Zbl 0397.68084
[4] 4. J. VAN LEEUWEN, Private communication, 1978.
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.