The Entropy of Square-Free Words

Abstract

Finite alphabets of at least three letters permit the construction of square-free words of infinite length. We show that the entropy density is strictly positive and derive reasonable lower and upper bounds. Finally, we present an approximate formula which is asymptotically exact with rapid convergence in the number of letters.

18 pages

Cited by in corpus (6)

• Random Tilings: Concepts and Examples
• Improved bounds on the number of ternary square-free words
• On the entropy and letter frequencies of powerfree words
• There are level ternary circular square-free words of length $n$ for $n\ne 5,7,9,10,14,17.$
• On the Entropy and Letter Frequencies of Ternary Square-Free Words
• On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters