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

05/03/2019
by   Marieh Jahannia, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2021

A characterization of binary morphisms generating Lyndon infinite words

An infinite word is an infinite Lyndon word if it is smaller, with respe...
research
03/20/2023

Infinite Words and Morphic Languages Formalized in Isabelle/HOL

We present a formalization of basics related to infinite words in the ge...
research
03/13/2019

Generalized de Bruijn words and the state complexity of conjugate sets

We consider a certain natural generalization of de Bruijn words, and use...
research
02/05/2020

Avoidance of split overlaps

We generalize Axel Thue's familiar definition of overlaps in words, and ...
research
03/12/2020

It Means More if It Sounds Good: Yet Another Hypotheses Concerning the Evolution of Polysemous Words

This position paper looks into the formation of language and shows ties ...
research
10/07/2021

Transliteration of Foreign Words in Burmese

This manuscript provides general descriptions on transliteration of fore...
research
11/26/2019

Words Avoiding Reversed Factors, Revisited

In 2005, Rampersad and the second author proved a number of theorems abo...

Please sign up or login with your details

Forgot password? Click here to reset