On the subword complexity of iteratively generated infinite words

摘要

We obtain a formula for the subword complexity of some infinite words obtained from the initial symbol 0 by arbitrarily substituting symbols 0, 1,…, q - 1 to fixed finite words of equal length in the q-ary alphabet. The result of the paper is a generalization of the formula for the subword complexity of the Thue-Morse word in Avgustinovich (Discrete Anal. Oper. Res. 1 (1994) 3).