On an Algorithm for Multiperiodic Words
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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
CTU Central Library
2013-01-01
|
| Series: | Acta Polytechnica |
| Subjects: | |
| Online Access: | https://ojs.cvut.cz/ojs/index.php/ap/article/view/1827 |