Palindromic factorization of rich words

DOI10.1016/J.DAM.2022.03.030OpenAlexW3209514384WikidataQ114191460 ScholiaQ114191460MaRDI QIDQ2143052

Josef Rukavicka

Publication date: 30 May 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

rich wordspalindromic lengthpalindromic factorization

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• On palindromic factorization of words
• Extensions of rich words
• Palindromic rich words and run-length encodings
• Palindromic richness
• On generalized highly potential words
• A new characteristic property of rich words
• On the number of rich words
• A unique extension of rich words
• Sturmian jungle (or garden?) on multiliteral alphabets
• Diverse Palindromic Factorization Is NP-complete
• Upper bound for palindromic and factor complexity of rich words
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Palindromic factorization of rich words