1 paper
Jean-Paul Allouche, Michael Baake, Julien Cassaigne +1
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We sur…