The abelian complexity of infinite words and the Frobenius problem

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 denote the set of factors of x. What conditions on S and the abelian complexity of x guarantee that S(L_x) contains all but finitely many elements of N? We examine this question for some specific infinite words x having different abelian complexity functions.