Hostname: page-component-77c89778f8-9q27g Total loading time: 0 Render date: 2024-07-21T07:18:07.921Z Has data issue: false hasContentIssue false
  • English
  • Français

Corrigendum: On multiperiodic words

Published online by Cambridge University Press:  23 November 2011

Štěpán Holub
Štěpán Holub*
Affiliation:
Department of Algebra, Charles University, Sokolovská 83, 175 86 Praha, Czech Republic. holub@karlin.mff.cuni.cz
Get access

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.

Keywords

Periodicitycombinatorics on words
Type
Correction
Information
RAIRO - Theoretical Informatics and Applications , Volume 45 , Issue 4 , November 2011 , pp. 467 - 469
Copyright
© EDP Sciences 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Holub, Š., On multiperiodic words. RAIRO-Theor. Inf. Appl. 40 (2006) 583–591. Google Scholar
G. Richomme, personal communication (July 2011).