Words with unbounded periodicity complexity
Formal Languages and Automata Theory
2019-12-18 v2 Combinatorics
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.
Keywords
Cite
@article{arxiv.1306.3123,
title = {Words with unbounded periodicity complexity},
author = {Štěpán Holub},
journal= {arXiv preprint arXiv:1306.3123},
year = {2019}
}
Comments
some references adjusted