@article{ITA_1980__14_2_169_0, author = {Sommerhalder, R.}, title = {Classes of languages proof against regular pumping}, journal = {RAIRO. Informatique th\'eorique}, pages = {169--180}, publisher = {EDP-Sciences}, volume = {14}, number = {2}, year = {1980}, mrnumber = {581675}, zbl = {0449.68035}, language = {en}, url = {http://www.numdam.org/item/ITA_1980__14_2_169_0/} }
Sommerhalder, R. Classes of languages proof against regular pumping. RAIRO. Informatique théorique, Tome 14 (1980) no. 2, pp. 169-180. http://www.numdam.org/item/ITA_1980__14_2_169_0/
1. Un critère de rationnalité des langages algébriques. In M. NIVAT, Ed., Automata, Languages and Programming, 1972, pp. 359-365. | MR | Zbl
,2. 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 | Zbl
,3. A Necessary and Sufficient Pumping Lemma for Regular Languages, S.I.G.A.C.T. News summer, 1978, pp. 48-49. | Zbl
,4. Private communication, 1978.
,