Complexity of infinite sequences with zero entropy
Christian Mauduit, Carlos Gustavo Moreira · Acta Arithmetica · 2010
The complexity function of an infinite word w on a finite alphabet A is the sequence counting, for each nonnegative n, the number of words of lenght n on the alphabet A that are factors of the infinite word w. The goal of this work is to estimate the number of words of lenght n on the alphabet A that are factors of an infinite word w with a complexity function bounded by a given function f with subexponential growth. 2000 Mathematics Subject Classification: 68R15, 37B10.