Displaying similar documents to “A classification of periodic turtle sequences.”

Sequences of low arithmetical complexity

Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

Arithmetical complexity of a sequence is the number of words of length 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.