Greedy Palindromic Lengths

DOI10.1142/S0129054118500077zbMath1396.68083arXiv1606.05660OpenAlexW2963213077WikidataQ129867695 ScholiaQ129867695MaRDI QIDQ4640335

Gwenaël Richomme, Michelangelo Bucci

Publication date: 17 May 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.05660

zbMATH Keywords

periodicityfactorizationinfinite wordspalindromespalindromic length

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

Prefix palindromic length of the Sierpinski word ⋮ Palindromic length and reduction of powers ⋮ Sturmian numeration systems and decompositions to palindromes ⋮ On highly palindromic words: the ternary case

Uses Software

• EERTREE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On palindromic factorization of words
• A subquadratic algorithm for minimum palindromic factorization
• Counting distinct palindromes in a word in linear time
• On z-factorization and c-factorization of standard episturmian words
• Palindromic prefixes and episturmian words
• EERTREE: an efficient data structure for processing palindromes in strings
• Conjugation of standard morphisms and a generalization of singular words
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• On the Complexity of Finite Sequences
• Automatic Sequences
• Crochemore Factorization of Sturmian and Other Infinite Words
• Some properties of the singular words of the Fibonacci word

This page was built for publication: Greedy Palindromic Lengths