Factor versus palindromic complexity of uniformly recurrent infinite words

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq ΔC(n) + 2, for all n \in N. For a large class of words it is a better estimate of the palindromic complexity in terms of the factor complexity then the one presented by Allouche et al. We provide several examples of infinite words for which our estimate reaches its upper bound. In particular, we derive an explicit prescription for the palindromic complexity of infinite words coding r-interval exchange transformations. If the permutation πconnected with the transformation is given by π(k)=r+1-k for all k, then there is exactly one palindrome of every even length, and exactly r palindromes of every odd length.
16 pages, submitted to Theoretical Computer Science

Keywords

Combinatorics, 68R15

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv