{
  "id": "1507.08206",
  "version": "v1",
  "published": "2015-07-29T16:26:23.000Z",
  "updated": "2015-07-29T16:26:23.000Z",
  "title": "Non-repetitive complexity of infinite words",
  "authors": [
    "Jeremy Nicholson",
    "Narad Rampersad"
  ],
  "comment": "13 pages",
  "categories": [
    "math.CO",
    "cs.FL"
  ],
  "abstract": "The non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that appear at the beginning of x prior to the first repetition of a length-n factor. We examine general properties of the non-repetitive complexity function, as well as obtain formulas for the non-repetitive complexity of the Thue-Morse word, the Fibonacci word and the Tribonacci word.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-07-29T16:26:23.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68R15"
    ],
    "keywords": [
      "infinite word",
      "non-repetitive complexity function",
      "fibonacci word",
      "thue-morse word",
      "general properties"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}