Corrigendum: On multiperiodic words
RAIRO - Theoretical Informatics and Applications (2012)
- Volume: 45, Issue: 4, page 467-469
- ISSN: 0988-3754
Access Full Article
topAbstract
topHow to cite
topHolub, Štěpán. "Corrigendum: On multiperiodic words." RAIRO - Theoretical Informatics and Applications 45.4 (2012): 467-469. <http://eudml.org/doc/222015>.
@article{Holub2012,
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},
keywords = {Periodicity; combinatorics on words; periodicity},
language = {eng},
month = {1},
number = {4},
pages = {467-469},
publisher = {EDP Sciences},
title = {Corrigendum: On multiperiodic words},
url = {http://eudml.org/doc/222015},
volume = {45},
year = {2012},
}
TY - JOUR
AU - Holub, Štěpán
TI - Corrigendum: On multiperiodic words
JO - RAIRO - Theoretical Informatics and Applications
DA - 2012/1//
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; periodicity
UR - http://eudml.org/doc/222015
ER -
References
top- Š. Holub, On multiperiodic words. RAIRO-Theor. Inf. Appl.40 (2006) 583–591.
- G. Richomme, personal communication (July 2011).
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.