Copy the page URI to the clipboard
Richard, Christoph and Grimm, Uwe
(2004).
URL: https://eudml.org/doc/126891
Abstract
We enumerate all ternary length- 1 square-free words, which are words avoiding squares of words up to length 1, for 1 ≤ 24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary square-free words. We then consider ternary square-free words with fixed letter densities, thereby proving exponential growth for certain ensembles with various letter densities. We derive consequences for the free energy and entropy of ternary square-free words.