Displaying similar documents to “The minimal density of a letter in an infinite ternary square-free word is 0 · 2746 ⋯ .”

A generator of morphisms for infinite words

Pascal Ochem (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

We present an algorithm which produces, in some cases, infinite words avoiding both large fractional repetitions and a given set of finite words. We use this method to show that all the ternary patterns whose avoidability index was left open in Cassaigne's thesis are 2-avoidable. We also prove that there exist exponentially many 7 4 + -free ternary words and 7 5 + -free 4-ary words. Finally we give small morphisms for binary words containing only the squares , 1 and (01)² and for binary words...

Binary words avoiding the pattern AABBCABBA

Pascal Ochem (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that there are three types of infinite words over the two-letter alphabet {0,1} that avoid the pattern . These types, , , and , differ by the factor complexity and the asymptotic frequency of the letter 0. Type has polynomial factor complexity and letter frequency 1 2 . Type has exponential factor complexity and the frequency of the letter 0 is at least 0.45622 and at most 0.48684. Type is obtained from type ...