1997/10/01 by Michael Baake, Veit Elser, Uwe Grimm
Computer Science · Mathematics · Physics and Astronomy · #Authorship Attribution and Profiling #Cellular Automata and Applications #math-ph #math.CO #math.MP #semigroups and automata theory
paper · pdf · doi:10.1016/s0895-7177(97)00196-9
published as Mathl. Comput. Modelling 26 (1997) 13--26 · 18 pages
openalex publication_date 1997/10/01 · arxiv created 1998/09/08 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.