Words with unbounded periodicity complexity
arXiv:1306.3123 · doi:10.1142/S0218196714500362
Abstract
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 recurrent words with the periodicity complexity arbitrarily high at infinitely many positions.
arXiv commentsome references adjusted