Abstract
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k that has periods p1, . . . , pr, and the richest possible alphabet. We show that this algorithm can be easily stated and its correctness briefly proved using the class equivalence approach.