On an Algorithm for Multiperiodic Words
DOI:
https://doi.org/10.14311/1827Keywords:
periodicity, combinatorics on wordsAbstract
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1, . . . , pr, and the richest possible alphabet. We show that this algorithm can be easilystated and its correctness briefly proved using the class equivalence approach.Downloads
Downloads
Published
2013-01-04
Issue
Section
Articles
How to Cite
Holub, Štepán. (2013). On an Algorithm for Multiperiodic Words. Acta Polytechnica, 53(4). https://doi.org/10.14311/1827