22 citations · 75 across the 21 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.FL2013★ 1 cited
Words with unbounded periodicity complexity
Štěpán Holub
If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurre…
cs.FL2013
On an algorithm for multiperiodic words
Štěpán Holub
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 algorit…