Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Baake et al. (1997) studied this question.
Synapse has enriched 9 related papers. Consider them for comparative context: