Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words (Q2272382): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1905.01340 / rank | |||
Normal rank |
Revision as of 04:13, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words |
scientific article |
Statements
Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words (English)
0 references
10 September 2019
0 references
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).
0 references
Fibonacci word
0 references
\(m\)-bonacci word
0 references
Ziv-Lempel factorization
0 references
Crochemore factorization
0 references
palindrome
0 references
Sturmian words
0 references
episturmian words
0 references