vix.ing · top · new · best · stats · spec

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

2019/05/03 by Marieh Jahannia, Jahannia, Marieh, Morteza Mohammad-Noori +5 · 1 citation
Computer Science · #68R15 #Authorship Attribution and Profiling #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1905.01340

openalex publication_date 2019/05/03 · openalex created_date 2022/07/29 · openalex updated_date 2026/07/28

Abstract

We introduce a variation of the Ziv-Lempel and Crochemore factorizations of\nwords by requiring each factor to be a palindrome. We compute these\nfactorizations for the Fibonacci word, and more generally, for all m-bonacci\nwords.\n

Cited by

Related