On an algorithm for multiperiodic words
Formal Languages and Automata Theory
2013-10-04 v2 Combinatorics
Abstract
We consider an algorithm by Tijdeman and Zamboni constructing a word of a given length that has a given set of periods, and the richest possible alphabet. We show that this algorithm can be easily stated and its correctness briefly proved using the class equivalence approach.
Cite
@article{arxiv.1212.6609,
title = {On an algorithm for multiperiodic words},
author = {Štěpán Holub},
journal= {arXiv preprint arXiv:1212.6609},
year = {2013}
}
Comments
changes in the introduction, missing references added