Voir la notice de l'article provenant de la source Numdam
In this note we consider the longest word, which has periods , and does not have the period . The length of such a word can be established by a simple algorithm. We give a short and natural way to prove that the algorithm is correct. We also give a new proof that the maximal word is a palindrome.
@article{ITA_2006__40_4_583_0,
author = {Holub, \v{S}t\v{e}p\'an},
title = {On multiperiodic words},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {583--591},
publisher = {EDP-Sciences},
volume = {40},
number = {4},
year = {2006},
doi = {10.1051/ita:2006042},
mrnumber = {2277051},
zbl = {1110.68121},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2006042/}
}
TY - JOUR AU - Holub, Štěpán TI - On multiperiodic words JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2006 SP - 583 EP - 591 VL - 40 IS - 4 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita:2006042/ DO - 10.1051/ita:2006042 LA - en ID - ITA_2006__40_4_583_0 ER -
%0 Journal Article %A Holub, Štěpán %T On multiperiodic words %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2006 %P 583-591 %V 40 %N 4 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita:2006042/ %R 10.1051/ita:2006042 %G en %F ITA_2006__40_4_583_0
Holub, Štěpán. On multiperiodic words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 40 (2006) no. 4, pp. 583-591. doi: 10.1051/ita:2006042
Cité par Sources :