Corrigendum: On multiperiodic words
RAIRO. Theoretical Informatics and Applications, Tome 45 (2011) no. 4, pp. 467-469
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.
@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},
pages = {467--469},
year = {2011},
publisher = {EDP-Sciences},
volume = {45},
number = {4},
doi = {10.1051/ita/2011130},
mrnumber = {2876118},
zbl = {1232.68098},
language = {en},
url = {https://www.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 PY - 2011 SP - 467 EP - 469 VL - 45 IS - 4 PB - EDP-Sciences UR - https://www.numdam.org/articles/10.1051/ita/2011130/ DO - 10.1051/ita/2011130 LA - en ID - ITA_2011__45_4_467_0 ER -
Holub, Štěpán. Corrigendum: On multiperiodic words. RAIRO. Theoretical Informatics and Applications, Tome 45 (2011) no. 4, pp. 467-469. doi: 10.1051/ita/2011130





