| Issue |
RAIRO-Theor. Inf. Appl.
Volume 40, Number 4, October-December 2006
|
|
|---|---|---|
| Page(s) | 569 - 582 | |
| DOI | https://doi.org/10.1051/ita:2006041 | |
| Published online | 08 November 2006 | |
Sequences of low arithmetical complexity
1
Sobolev Institute of Mathematics SB RAS,
Koptyug Av. 4, Novosibirsk, Russia; avgust@math.nsc.ru; frid@math.nsc.ru
2
Institut de Mathématiques de Luminy, case 907,
163 Av. de Luminy, 13288 Marseille Cedex 9, France; cassaigne@iml.univ-mrs.fr
Received:
1
October
2003
Accepted:
30
October
2003
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
Key words: Arithmetical complexity / infinite words / Toeplitz words / special factors / period doubling word / Legendre symbol / paperfolding word.
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.