On the number of return words in infinite words with complexity 2n+1

Laurent Vuillon (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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.

Domaines: Combinatoire [math.CO]; Systèmes dynamiques [math.DS]

Laurent Vuillon. On the number of return words in infinite words with complexity 2n+1. 2000. ⟨hal-00022180⟩