{
  "id": "math/0009094",
  "version": "v1",
  "published": "2000-09-08T16:45:44.000Z",
  "updated": "2000-09-08T16:45:44.000Z",
  "title": "On the number of return words in infinite words with complexity 2n+1",
  "authors": [
    "Laurent Vuillon"
  ],
  "comment": "see also http://liafa.jussieu.fr/~vuillon/articles.html",
  "categories": [
    "math.CO",
    "math.DS"
  ],
  "abstract": "In this article, we count the number of return words in some infinite words with complexity 2n+1. We also consider some infinite words given by codings of rotation and interval exchange transformations on k intervals. We prove that the number of return words over a given word w for these infinite words is exactly k.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2000-09-08T16:45:44.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "68R15"
    ],
    "keywords": [
      "infinite words",
      "return words",
      "complexity",
      "interval exchange transformations"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2000math......9094V"
    }
  }
}