Unavoidable languages, cuts and innocent sets of words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 5, pp. 339-382
Cet article a éte moissonné depuis la source Numdam
@article{ITA_1995__29_5_339_0,
author = {Rosaz, L.},
title = {Unavoidable languages, cuts and innocent sets of words},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {339--382},
year = {1995},
publisher = {EDP-Sciences},
volume = {29},
number = {5},
mrnumber = {1360665},
zbl = {0838.68068},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ITA_1995__29_5_339_0/}
}
TY - JOUR AU - Rosaz, L. TI - Unavoidable languages, cuts and innocent sets of words JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1995 SP - 339 EP - 382 VL - 29 IS - 5 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1995__29_5_339_0/ LA - en ID - ITA_1995__29_5_339_0 ER -
%0 Journal Article %A Rosaz, L. %T Unavoidable languages, cuts and innocent sets of words %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1995 %P 339-382 %V 29 %N 5 %I EDP-Sciences %U http://geodesic.mathdoc.fr/item/ITA_1995__29_5_339_0/ %G en %F ITA_1995__29_5_339_0
Rosaz, L. Unavoidable languages, cuts and innocent sets of words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 5, pp. 339-382. http://geodesic.mathdoc.fr/item/ITA_1995__29_5_339_0/