Results 1 
2 of
2
On the Entropy and Letter Frequencies of Ternary SquareFree Words
, 2003
"... We enumerate all ternary lengthℓ squarefree words, which are words avoiding squares of words up to length ℓ, for ℓ ≤ 24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary squarefree words. We then consider ternary squar ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We enumerate all ternary lengthℓ squarefree words, which are words avoiding squares of words up to length ℓ, for ℓ ≤ 24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary squarefree words. We then consider ternary squarefree 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 squarefree words.
2011): Fife’s theorem for (7/3)powers
 WORDS 2011, 8th International Conference
"... We prove a Fifelike characterization of the infinite binary 73powerfree words, by giving a finite automaton of 15 states that encodes all such words. As a consequence, we characterize all such words that are 2automatic. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We prove a Fifelike characterization of the infinite binary 73powerfree words, by giving a finite automaton of 15 states that encodes all such words. As a consequence, we characterize all such words that are 2automatic. 1