| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10334741 | Theoretical Computer Science | 2005 | 20 Pages |
Abstract
Arithmetical complexity of infinite sequences is the number of all words of a given length whose symbols occur in the sequence at positions which constitute arithmetical progressions. We show that uniformly recurrent sequences whose arithmetical complexity grows linearly are precisely Toeplitz words of a specific form.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
A.E. Frid,