Citation

Baake M, Elser V, Grimm U. Math. Comput. Model. 1997; 26(8-10): 13-26.

Copyright

(Copyright © 1997, Elsevier Publishing)

DOI

10.1016/S0895-7177(97)00196-9

PMID

unavailable

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.