In this paper, we study the critical exponent of infinite words u尾 coding 尾-integers for 尾 being a non-simple Parry number. In other words, we investigate the maximal consecutive repetitions of factors that occur in the infinite word in question. We calculate also the ultimate critical exponent that expresses how long repetitions occur in the infinite word u尾 when the factors of length growing ad infinitum are considered. The basic ingredients of our method are the description of all bispecial factors of u尾 and the notion of return words. This method can be applied to any fixed point of any primitive substitution.
展开▼
