Subword complexity of uniform D0L words over finite groups

We deal with the subword complexity of uniform D0L words obtained from group substitutions. Our main interest is whether the subword complexity is “almost proportional” to the length of the factor. We find necessary and sufficient conditions for that. For some cases we show that this is impossible.