Prohlížení Acta Polytechnica. 2013, vol. 53, no. 4 dle předmětu "combinatorics on words"
Zobrazují se záznamy 1-1 z 1
-
On an Algorithm for Multiperiodic Words
(České vysoké učení technické v PrazeCzech Technical University in Prague, 2013)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 ...