Arithmetical subword complexity of automatic sequences

Jakub Konieczny, Clemens Müllner

We fully classify automatic sequences $a$ over a finite alphabet $\Omega$ with the property that each word over $\Omega$ appears is $a$ along an arithmetic progression. Using the terminology…