Mathematical Citation Quotient (MCQ) 2018: 0.40
Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
The factor complexity of the infinite word u β canonically associated with a non-simple Parry number β is studied. Our approach is based on the notion of special factors introduced by Berstel and Cassaigne. At first, we give a handy method for determining infinite left special branches; this method is applicable to a broad class of infinite words which are fixed points of a primitive substitution. In the second part of the article, we focus on infinite words u β only. To complete the description of their special factors, we define and study (a, b)-maximal left special factors. This enables us to characterize non-simple Parry numbers β for which the word u β has affine complexity.
Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.