Classes of languages proof against regular pumping
RAIRO. Informatique théorique, Tome 14 (1980) no. 2, pp. 169-180. 
@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://archive.numdam.org/item/ITA_1980__14_2_169_0/}
}
TY  - JOUR
AU  - Sommerhalder, R.
TI  - Classes of languages proof against regular pumping
JO  - RAIRO. Informatique théorique
PY  - 1980
SP  - 169
EP  - 180
VL  - 14
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1980__14_2_169_0/
LA  - en
ID  - ITA_1980__14_2_169_0
ER  - 
%0 Journal Article
%A Sommerhalder, R.
%T Classes of languages proof against regular pumping
%J RAIRO. Informatique théorique
%D 1980
%P 169-180
%V 14
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1980__14_2_169_0/
%G en
%F 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://archive.numdam.org/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 | Zbl

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 | Zbl

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

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