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

How to Cite

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

Issue

Section

Articles