Abstract:
The subword complexity of an infinite word ξ is a function
ƒ (ξ, n) returning the number of finite subwords (factors,
infixes) of length n of ξ. In the present paper we investigate infinite
words for which the set of subwords occurring infinitely
often is a regular language. Among these infinite words we
characterise those which are eventually recurrent.
Furthermore, we derive some results comparing the asymptotics
of ƒ (ξ, n) to the information content of sets of finite or
infinite words related to ξ. Finally we give a simplified proof of
Theorem 6 of [Sta98].