Corrigendum: On multiperiodic words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2011)
- Volume: 45, Issue: 4, page 467-469
- ISSN: 0988-3754
Access Full Article
top
Abstract
topHow to cite
topHolub, Štěpán. "Corrigendum: On multiperiodic words." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 45.4 (2011): 467-469. <http://eudml.org/doc/273009>.
@article{Holub2011,
abstract = {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.},
author = {Holub, Štěpán},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {periodicity; combinatorics on words},
language = {eng},
number = {4},
pages = {467-469},
publisher = {EDP-Sciences},
title = {Corrigendum: On multiperiodic words},
url = {http://eudml.org/doc/273009},
volume = {45},
year = {2011},
}
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
PB - EDP-Sciences
VL - 45
IS - 4
SP - 467
EP - 469
AB - 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.
LA - eng
KW - periodicity; combinatorics on words
UR - http://eudml.org/doc/273009
ER -
References
top- [1] Š. Holub, On multiperiodic words. RAIRO-Theor. Inf. Appl. 40 (2006) 583–591. Zbl1110.68121MR2277051
- [2] G. Richomme, personal communication (July 2011).
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.