On low-complexity bi-infinite words and their factors
In this paper we study bi-infinite words on two letters. We say that such a word has stiffness if the number of different subwords of length equals for all sufficiently large. The word is called -balanced if the numbers of occurrences of the symbol a in any two subwords of the same length differ by at most . In the present paper we give a complete description of the class of bi-infinite words of stiffness and show that the number of subwords of length from this class has growth order...