corrige
On multiperiodic words
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.
DOI :
10.1051/ita/2011130
Classification :
68R15
Mots-clés : periodicity, combinatorics on words
Mots-clés : periodicity, combinatorics on words
@article{ITA_2011__45_4_467_0, author = {Holub, \v{S}t\v{e}p\'an}, title = {Corrigendum: {On} multiperiodic words}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {467--469}, publisher = {EDP-Sciences}, volume = {45}, number = {4}, year = {2011}, doi = {10.1051/ita/2011130}, mrnumber = {2876118}, zbl = {1232.68098}, language = {en}, url = {http://archive.numdam.org/articles/10.1051/ita/2011130/} }
TY - JOUR AU - Holub, Štěpán TI - Corrigendum: On multiperiodic words JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2011 SP - 467 EP - 469 VL - 45 IS - 4 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ita/2011130/ DO - 10.1051/ita/2011130 LA - en ID - ITA_2011__45_4_467_0 ER -
%0 Journal Article %A Holub, Štěpán %T Corrigendum: On multiperiodic words %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2011 %P 467-469 %V 45 %N 4 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ita/2011130/ %R 10.1051/ita/2011130 %G en %F 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) no. 4, pp. 467-469. doi : 10.1051/ita/2011130. http://archive.numdam.org/articles/10.1051/ita/2011130/