{
  "id": "0902.0632",
  "version": "v2",
  "published": "2009-02-03T22:10:12.000Z",
  "updated": "2010-09-26T16:35:34.000Z",
  "title": "A Note on Symmetries in the Rauzy Graph and Factor Frequencies",
  "authors": [
    "L. Balkova",
    "E. Pelantova"
  ],
  "comment": "7 pages",
  "journal": "Theoret. Comput. Sci. 410 (2009), 2779-2783",
  "categories": [
    "math.CO"
  ],
  "abstract": "We focus on infinite words with languages closed under reversal. If frequencies of all factors are well defined, we show that the number of different frequencies of factors of length n+1 does not exceed 2C(n+1)-2C(n)+1.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2010-09-26T16:35:34.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68R15"
    ],
    "keywords": [
      "rauzy graph",
      "factor frequencies",
      "symmetries",
      "infinite words"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0902.0632B"
    }
  }
}