# Palindromic Ziv-Lempel and Crochemore Factorizations of $m$-Bonacci Infinite Words

## TL;DR

This paper introduces palindromic variants of Ziv-Lempel and Crochemore factorizations, computes them for Fibonacci and m-bonacci words, and explores their structural properties.

## Contribution

It presents a novel palindromic factorization approach and extends it to Fibonacci and m-bonacci words, enriching combinatorial word analysis.

## Key findings

- Palindromic factorizations are explicitly computed for Fibonacci words.
- The method generalizes to all m-bonacci words.
- Structural properties of these factorizations are analyzed.

## 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.