Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words (Q2272382)

The authors consider a palindromic version of Ziv-Lempel and Crochemore factorizations of strings, where new prefixes in addition to usual properties should be palindromes. Clearly, such factorizations exist only for a relatively narrow class of infinite words containing infinitely many palindromes. In the paper, they are given precisely for the Fibonacci word and its generalizations on larger alphabets, called \(m\)-bonacci words. The authors also mention a series of open questions on similar factorizations of the Thue-Morse word, all episturmian words or all rich words (in the sense of palindromic richness).