Sciweavers

ITA
2006

Sequences of low arithmetical complexity

14 years 12 days ago
Sequences of low arithmetical complexity
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. Mathematics Subject Classification. 68R15.
Sergey V. Avgustinovich, Julien Cassaigne, Anna E.
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where ITA
Authors Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid
Comments (0)