Classes of languages proof against regular pumping
Sommerhalder, R.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 14 (1980), p. 169-180 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1980-01-01
@article{ITA_1980__14_2_169_0,
     author = {Sommerhalder, R.},
     title = {Classes of languages proof against regular pumping},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {14},
     year = {1980},
     pages = {169-180},
     mrnumber = {581675},
     zbl = {0449.68035},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1980__14_2_169_0}
}

Sommerhalder, R. Classes of languages proof against regular pumping. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 14 (1980) pp. 169-180. http://gdmltest.u-ga.fr/item/ITA_1980__14_2_169_0/

1. L. Boasson, Un critère de rationnalité des langages algébriques. In M. NIVAT, Ed., Automata, Languages and Programming, 1972, pp. 359-365. | MR 368487 | Zbl 0263.68038

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. | Numdam | MR 510636 | Zbl 0387.68053

3. J. Jaffe, A Necessary and Sufficient Pumping Lemma for Regular Languages, S.I.G.A.C.T. News summer, 1978, pp. 48-49. | Zbl 0397.68084

4. J. Van Leeuwen, Private communication, 1978.