Laurent Vuillon
Published 2000-09-08Version 1
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.
Comments: see also http://liafa.jussieu.fr/~vuillon/articles.html
On the Complexity of Polytope Isomorphism Problems
A new estimate on complexity of binary generalized pseudostandard words
The complexity of the $q$-analog of the $n$-cube
![QR code for arXiv:math/0009094 [math.CO]](http://oss.arxitics.com/images/favicon.svg)