On a class of infinite words with affine factor complexity
Combinatorics
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.math/0612466,
title = {On a class of infinite words with affine factor complexity},
author = {J. Bernat and Z. Masáková and E. Pelantová},
journal= {arXiv preprint arXiv:math/0612466},
year = {2007}
}
Comments
14 pages