Hayri Ardal, Tom Brown, Veselin Jungić, Julian Sahasrabudhe
Published 2011-07-23Version 1
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.
Some further results on squarefree arithmetic progressions in infinite words
The meet operation in the imbalance lattice of maximal instantaneous codes: alternative proof of existence
A Coloring Problem for Infinite Words
![QR code for arXiv:1107.4654 [math.CO]](http://oss.arxitics.com/images/favicon.svg)