On the number of return words in infinite words with complexity 2n+1
Vuillon, Laurent
HAL, hal-00022180 / Harvested from HAL
Text on HAL
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.
Publié le : 2000-07-05
Classification:  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],  [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS] 
@article{hal-00022180,
     author = {Vuillon, Laurent},
     title = {On the number of return words in infinite words with complexity 2n+1},
     journal = {HAL},
     volume = {2000},
     number = {0},
     year = {2000},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00022180}
}

Vuillon, Laurent. On the number of return words in infinite words with complexity 2n+1. HAL, Tome 2000 (2000) no. 0, . http://gdmltest.u-ga.fr/item/hal-00022180/