Palindromic length and reduction of powers

DOI10.1016/J.TCS.2022.07.015OpenAlexW3149197572MaRDI QIDQ2166768

Josef Rukavicka

Publication date: 25 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

power-free wordspalindromic lengthpalindromic factorization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• On palindromic factorization of words
• A subquadratic algorithm for minimum palindromic factorization
• EERTREE: an efficient data structure for processing palindromes in strings
• Palindromic length in free monoids and free groups
• Sturmian numeration systems and decompositions to palindromes
• Palindromic length of words with many periodic palindromes
• First lower bounds for palindromic length
• Palindromic length of words and morphisms in class \(\mathcal{P}\)
• Greedy Palindromic Lengths
• Palindromic length in linear time
• Computing Palindromic Factorizations and Palindromic Covers On-line

This page was built for publication: Palindromic length and reduction of powers