4 research outputs found
Arithmetical subword complexity of automatic sequences
We fully classify automatic sequences over a finite alphabet
with the property that each word over appears is along an
arithmetic progression. Using the terminology introduced by Avgustinovich,
Fon-Der-Flaass and Frid, these are the automatic sequences with the maximal
possible arithmetical subword complexity. More generally, we obtain an
asymptotic formula for arithmetical (and even polynomial) subword complexity of
a given automatic sequence .Comment: 14 pages, comments welcom
On possible growths of arithmetical complexity
The arithmetical complexity of infinite words, defined by Avgustinovich, Fon-Der-Flaass and the author in 2000, is the number of words of length n which occur in the arithmetical subsequences of the infinite word. This is one of the modifications of the classical function of subword complexity, which is equal to the number of factors of the infinite word of length n. In this paper, we show that the orders of growth of the arithmetical complexity can behave as many sub-polynomial functions. More precisely,
for each sequence u of subword complexity ƒu(n) and for each prime p ≥ 3 we build a Toeplitz word on the same alphabet whose arithmetical complexity is