{
  "id": "1107.4654",
  "version": "v1",
  "published": "2011-07-23T04:05:16.000Z",
  "updated": "2011-07-23T04:05:16.000Z",
  "title": "On abelian and additive complexity in infinite words",
  "authors": [
    "Hayri Ardal",
    "Tom Brown",
    "Veselin Jungić",
    "Julian Sahasrabudhe"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-07-23T04:05:16.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05D99"
    ],
    "keywords": [
      "infinite words",
      "finite subset",
      "define bounded additive complexity",
      "bounded abelian complexity",
      "alternative proof"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1107.4654A"
    }
  }
}