Let tn be the number of words of length n in a factorial language L. We adapt the transfert matrix method to obtain upper bounds on the growth rate of words in L defined as limn→∞ (tn) 1 n . This method is used to lower the best known upper bounds on the growth rate of ternary square-free words from 1.30193812.. to 1.30178858..
