On abelian and additive complexity in infinite words
  The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Z^m. We provide an alternative proof of one of the results of Richomme, Saari, and Zamboni. 
Hayri Ardal, Tom Brown, Veselin Jungi\'c, Julian Sahasrabudhe
math.CO