Decidability of periodicity for infinite words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 1, pp. 43-46
Cet article a éte moissonné depuis la source Numdam
@article{ITA_1986__20_1_43_0,
author = {Pansiot, Jean-Jacques},
title = {Decidability of periodicity for infinite words},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {43--46},
year = {1986},
publisher = {AFCET - Gauthier-Villars},
address = {Paris},
volume = {20},
number = {1},
mrnumber = {849964},
zbl = {0617.68063},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ITA_1986__20_1_43_0/}
}
TY - JOUR AU - Pansiot, Jean-Jacques TI - Decidability of periodicity for infinite words JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1986 SP - 43 EP - 46 VL - 20 IS - 1 PB - AFCET - Gauthier-Villars PP - Paris UR - http://geodesic.mathdoc.fr/item/ITA_1986__20_1_43_0/ LA - en ID - ITA_1986__20_1_43_0 ER -
%0 Journal Article %A Pansiot, Jean-Jacques %T Decidability of periodicity for infinite words %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1986 %P 43-46 %V 20 %N 1 %I AFCET - Gauthier-Villars %C Paris %U http://geodesic.mathdoc.fr/item/ITA_1986__20_1_43_0/ %G en %F ITA_1986__20_1_43_0
Pansiot, Jean-Jacques. Decidability of periodicity for infinite words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 1, pp. 43-46. http://geodesic.mathdoc.fr/item/ITA_1986__20_1_43_0/