Complexity of infinite sequences with zero entropy
Complexity of infinite sequences with zero entropy
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 …