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\ud fixed letter densities, thereby proving exponential growth for certain ensembles with various letter densities. We derive consequences for the free energy and entropy of\ud ternary square-free words
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.