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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
see also http://liafa.jussieu.fr/~vuillon/articles.html

Keywords

Combinatorics, Dynamical Systems, 68R15

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/59903

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0009094
 http://arxiv.org/abs/math/0009094

Collections

arXiv