The abelian complexity of infinite words and the Frobenius problem

Ian Kaye, Narad Rampersad

We study the following problem, first introduced by Dekking. Consider an infinite word x over an alphabet {0,1,...,k-1} and a semigroup homomorphism S:{0,1,...,k-1}* -> N. Let L_x…