On an Algorithm for Multiperiodic Words

Authors

  • Štepán Holub

DOI:

https://doi.org/10.14311/1827

Keywords:

periodicity, combinatorics on words

Abstract

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

Download data is not yet available.

Author Biography

  • Štepán Holub

Downloads

Published

2013-01-04

Issue

Vol. 53 No. 4 (2013)

Section

Articles

License

Authors who publish with this journal agree to the following terms:

1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

4. ddd

How to Cite

Holub, Štepán. (2013). On an Algorithm for Multiperiodic Words. Acta Polytechnica, 53(4). https://doi.org/10.14311/1827