Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words
classification
💻 cs.DM
cs.FLmath.CO
keywords
factorizationswordsbonaccicrochemoreziv-lempelcomputefactorfibonacci
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.