Sequences of low arithmetical complexity
S. V. Avgustinovich, Julien Cassaigne, Anna E. Frid · RAIRO - Theoretical Informatics and Applications · 2006
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of low arithmetical complexity and describe the family of such words having lowest complexity.