On multiperiodic words
Department of Algebra, Charles University, Sokolovská 83, 175 86 Praha, Czech Republic;
Accepted: 18 October 2005
In this note we consider the longest word, which has periods p1,...,pn, and does not have the period gcd(p1,...,pn). The length of such a word can be established by a simple algorithm. We give a short and natural way to prove that the algorithm is correct. We also give a new proof that the maximal word is a palindrome.
Mathematics Subject Classification: 68R15
Key words: Periodicity / combinatorics on words.
© EDP Sciences, 2006