Article (Scientific journals)
Closed Ziv-Lempel factorization of the m-bonacci words
Jahannia, Marieh; Mohammad-noori, Morteza; Narad, Rampersad et al.
2022In Theoretical Computer Science, 918, p. 32-47
Peer Reviewed verified by ORBi
 

Files


Full Text
Closed-Z-factorization-submission-2.pdf
Author preprint (213.08 kB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Ziv–Lempel factorization; Crochemore factorization; Closed words; Fibonacci word; m-bonacci word; episturmian words
Abstract :
[en] A word w is said to be closed if it has a proper factor x which occurs exactly twice in w, as a prefix and as a suffix of w. Based on the concept of Ziv-Lempel factorization, we define the closed z-factorization of finite and infinite words. Then we find the closed z-factorization of the infinite m-bonacci words for all m ≥ 2. We also classify closed prefixes of the infinite m-bonacci words.
Disciplines :
Mathematics
Author, co-author :
Jahannia, Marieh
Mohammad-noori, Morteza
Narad, Rampersad
Stipulanti, Manon  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Closed Ziv-Lempel factorization of the m-bonacci words
Publication date :
2022
Journal title :
Theoretical Computer Science
ISSN :
0304-3975
Publisher :
Elsevier, Netherlands
Volume :
918
Pages :
32-47
Peer reviewed :
Peer Reviewed verified by ORBi
Funders :
F.R.S.-FNRS - Fonds de la Recherche Scientifique [BE]
Available on ORBi :
since 18 January 2022

Statistics


Number of views
42 (5 by ULiège)
Number of downloads
35 (4 by ULiège)

Scopus citations®
 
3
Scopus citations®
without self-citations
3
OpenCitations
 
0

Bibliography


Similar publications



Contact ORBi