2000 character limit reached
Palindromic Ziv-Lempel and Crochemore Factorizations of $m$-Bonacci Infinite Words (1905.01340v1)
Published 3 May 2019 in cs.DM, cs.FL, and math.CO
Abstract: We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci word, and more generally, for all $m$-bonacci words.