Article contents
On multiperiodic words
Published online by Cambridge University Press: 08 November 2006
Abstract
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.
Keywords
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 40 , Issue 4 , October 2006 , pp. 583 - 591
- Copyright
- © EDP Sciences, 2006
References
- 3
- Cited by