2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/59903In 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.see also http://liafa.jussieu.fr/~vuillon/articles.htmlCombinatoricsDynamical Systems68R15text