Asymptotic subword complexity of fixed points of group substitutions

The subword complexity of fixed points of some types of substitutions was studied by various authors. Here we introduce a family of substitutions, arising from multiplication tables of finite groups and other similar structures, and analyze their subword complexity.