{
  "id": "1101.1490",
  "version": "v1",
  "published": "2011-01-07T18:15:25.000Z",
  "updated": "2011-01-07T18:15:25.000Z",
  "title": "Abelian Complexity of Infinite Words Associated with Quadratic Parry Numbers",
  "authors": [
    "Ľubomíra Balková",
    "Karel Břinda",
    "Ondřej Turek"
  ],
  "comment": "12 pages",
  "journal": "Theor. Comput. Sci. 412 (2011), 6252-6260",
  "doi": "10.1016/j.tcs.2011.08.016",
  "categories": [
    "math.CO"
  ],
  "abstract": "We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-01-07T18:15:25.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68R15"
    ],
    "keywords": [
      "quadratic parry numbers",
      "infinite words",
      "abelian complexity",
      "explicit formula"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1101.1490B"
    }
  }
}