On a class of infinite words with affine factor complexity

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an affine factor complexity map C(n), that is, such that C(n)=an+b for any integer n.
14 pages

Keywords

Combinatorics, 11A63, 11A67, 37B10, 68R15

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv