| Issue |
RAIRO-Theor. Inf. Appl.
Volume 40, Number 4, October-December 2006
|
|
|---|---|---|
| Page(s) | 583 - 591 | |
| DOI | https://doi.org/10.1051/ita:2006042 | |
| Published online | 08 November 2006 | |
On multiperiodic words
Department of Algebra, Charles University, Sokolovská 83, 175 86 Praha, Czech Republic;
holub@karlin.mff.cuni.cz
Received:
1
August
2005
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.