On the number of return words in infinite words with complexity 2n+1
Combinatorics
2007-05-23 v1 Dynamical Systems
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.
Keywords
Cite
@article{arxiv.math/0009094,
title = {On the number of return words in infinite words with complexity 2n+1},
author = {Laurent Vuillon},
journal= {arXiv preprint arXiv:math/0009094},
year = {2007}
}
Comments
see also http://liafa.jussieu.fr/~vuillon/articles.html