... abcacbacabacbcabacabcacbcabacbcacba (# a = 13, #b= 10, #c= 12) ,w2= abcacbcabacbabcbacabcbabcabacbcacba (# a = 12, #b= 12, #c= 11) ,w3= abcacbacabacbcabacabcbabcabacbcacba (# a = 13, #b= 11, #c= 11) ,(20) of ... exponentially with n. Denoting the sets of ternary square-free words of length nby A n,wehave A 0= {λ}, A 1= {a, b, c}, A 2= {ab, ac, ba, bc, ca, cb}, A 3= {aba, abc, aca, acb, bab, bac, bca, ... number of letters a, b and c in any of the words w(j) a by n a a, nb a and nc a , respectively, with n a a+ nb a + nc a = m ,and analogously for w(j)b and w(j)c, we can summarise the...