A note on differentiable palindromes
We give a characterization of the palindromes in a class of infinite words over Sigma = {1,2} related to the Kolakoski word K. This characterization, based on the left palindromic closure of all prefixes of K, is obtained by using a bijection between the class of right infinite words over Sigma and a class of words over the same alphabet, and reveals the first link between the existence of some palindromes and the recurrence of K. Indeed, the existence of arbitrarily long palindromes implies the recurrence of K, and a stronger assumption implies the closure of the set of its factors by permutation of the letters in Sigma. (C) 2002 Elsevier Science B.V. All rights reserved.
kolakoski word recurrence combinatorics on words palindrome complexity