The Entropy of Square-Free Words
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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
18 pages