Asymptotic Subword Complexity
نویسنده
چکیده
The subword complexity of an infinite word ξ is a function f (ξ, 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 f (ξ, 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]. ∗email: [email protected]
منابع مشابه
Subword complexities and iteration
This paper is an overview of results' on the subword complexity of various classes of languages obtained by iterating a mapping, and more precisely on the asymptotic behaviour of this complexity. In the first section we consider iterated morphisms, that is DOL languages. In this area the subword complexity falls into one of five classes, and class membership can be determined. The second sectio...
متن کاملOn the Asymptotic Abelian Complexity of Morphic Words
The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts this number up to letter permutation. Although a lot of research has been done on the subword complexity of morphic words, i.e., words obtained as fixed points of iterated morphisms, little is known on their abelian complexity. In this paper, we undertake the classific...
متن کاملOn possible growths of Toeplitz languages
We consider a new family of factorial languages whose subword complexity grows as Θ(nα), where α is the only positive root of some transcendent equation. The asymptotic growth of the complexity function is studied with the use of analytical methods and in particular with a corollary of the Wiener-Pitt theorem. The factorial languages considered are also languages of arithmetic factors of infini...
متن کاملSubword complexity and power avoidance
We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that – the Thue-Morse word has the minimum possible subword complexity over all overlapfree binary words and all (73)-power-free binary words, but not over all ( 7 3) +-power-free binary words; – the twisted Thue-Morse word has the maximum possible sub...
متن کاملState Complexity of the Subword Closure Operation with Applications to DNA Coding
We are interested in the state complexity of languages that are defined via the subword closure operation. The subword closure of a set S of fixed-length words is the set of all words w for which any subword of w of the fixed length is in S. This type of constraint appears to be useful in various situations related to data encodings and in particular to DNA encodings. We present a few results r...
متن کامل