Article (Scientific journals)
Palindromic Ziv–Lempel and Crochemore Factorizations of m-Bonacci Infinite Words
Jahannia, Marieh; Mohammad-noori, Morteza; Rampersad, Narad et al.
2019In Theoretical Computer Science, p. 16-40
Peer Reviewed verified by ORBi
 

Files


Full Text
pal-fact.pdf
Author postprint (230.91 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Ziv–Lempel factorization; Crochemore factorization; palindrome; Fibonacci word; m-bonacci word; singular words; episturmian words
Abstract :
[en] 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.
Disciplines :
Mathematics
Author, co-author :
Jahannia, Marieh;  University of Tehran > School of Mathematics, Statistics and Computer Science, College of Science
Mohammad-noori, Morteza;  University of Tehran > School of Mathematics, Statistics and Computer Science, College of Science
Rampersad, Narad;  University of Winnipeg > Department of Mathematics and Statistics
Stipulanti, Manon  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Palindromic Ziv–Lempel and Crochemore Factorizations of m-Bonacci Infinite Words
Publication date :
2019
Journal title :
Theoretical Computer Science
ISSN :
0304-3975
Publisher :
Elsevier, Netherlands
Special issue title :
790
Pages :
16-40
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBi :
since 03 May 2019

Statistics


Number of views
53 (7 by ULiège)
Number of downloads
91 (2 by ULiège)

Scopus citations®
 
4
Scopus citations®
without self-citations
3
OpenCitations
 
1

Bibliography


Similar publications



Contact ORBi