On abelian and additive complexity in infinite words
Combinatorics
2011-07-26 v1
Abstract
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.
Cite
@article{arxiv.1107.4654,
title = {On abelian and additive complexity in infinite words},
author = {Hayri Ardal and Tom Brown and Veselin Jungić and Julian Sahasrabudhe},
journal= {arXiv preprint arXiv:1107.4654},
year = {2011}
}