Corrigendum: On multiperiodic words
Holub, Štěpán
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 45 (2011), p. 467-469 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)

An algorithm is corrected here that was presented as Theorem 2 in [Š. Holub, RAIRO-Theor. Inf. Appl. 40 (2006) 583-591]. It is designed to calculate the maximum length of a nontrivial word with a given set of periods.

Publié le : 2011-01-01
DOI : https://doi.org/10.1051/ita/2011130
Classification:  68R15 
@article{ITA_2011__45_4_467_0,
     author = {Holub, \v St\v ep\'an},
     title = {Corrigendum: On multiperiodic words},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {45},
     year = {2011},
     pages = {467-469},
     doi = {10.1051/ita/2011130},
     mrnumber = {2876118},
     zbl = {1232.68098},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_2011__45_4_467_0}
}

Holub, Štěpán. Corrigendum: On multiperiodic words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 45 (2011) pp. 467-469. doi : 10.1051/ita/2011130. http://gdmltest.u-ga.fr/item/ITA_2011__45_4_467_0/

[1] Š. Holub, On multiperiodic words. RAIRO-Theor. Inf. Appl. 40 (2006) 583-591. | Numdam | MR 2277051 | Zbl 1110.68121

[2] G. Richomme, personal communication (July 2011).