Sequences of linear arithmetical complexity

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.