Complexity for Infinite Words Associated with Quadratic Non-Simple Parry Numbers

Abstract

Studying of complexity of infinite aperiodic words, i.e., the number of different factors of the infinite word of a fixed length, is an interesting combinatorial problem. Moreover, investigation of infinite words associated with $\beta$-integers can be interpreted as investigation of one-dimensional quasicrystals. In such a way of interpretation, complexity corresponds to the number of local configurations of atoms.