Title of article
The entropy of square-free words
Author/Authors
Baake، نويسنده , , M. and Elser، نويسنده , , V. and Grimm، نويسنده , , U.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
14
From page
13
To page
26
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.
Keywords
Combinatorics on words , Substitution rules , entropy , Random tilings
Journal title
Mathematical and Computer Modelling
Serial Year
1997
Journal title
Mathematical and Computer Modelling
Record number
1590840
Link To Document