Palindromic rich words and run-length encodings

DOI10.1016/J.IPL.2016.07.001zbMath1371.68221arXiv1503.09112OpenAlexW1492505833WikidataQ60692197 ScholiaQ60692197MaRDI QIDQ738876

Chuan Guo, Arseny M. Shur, Jeffrey O. Shallit

Publication date: 16 August 2016

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial problemspalindromegrowth functioninteger partitionrich word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (11)

Palindromic factorization of rich words ⋮ On Morphisms Preserving Palindromic Richness ⋮ Palindromic length of words and morphisms in class \(\mathcal{P}\) ⋮ Rich words in the block reversal of a word ⋮ On generalized highly potential words ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Counting Palindromes in Substrings ⋮ Block reversal on finite words ⋮ Improved estimates for the number of privileged words ⋮ On highly palindromic words: the ternary case ⋮ Upper bound for palindromic and factor complexity of rich words

Uses Software

• OEIS
• EERTREE

Cites Work

• Unnamed Item
• Unnamed Item
• Growth properties of power-free languages
• Rich, Sturmian, and trapezoidal words
• Palindromic richness
• On intermediate factorial languages
• EERTREE: an efficient data structure for processing palindromes in strings
• On the Number of Closed Factors in a Word
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Rich and Periodic-Like Words
• A Linear-Time On-Line Recognition Algorithm for ``Palstar
• Fast Pattern Matching in Strings
• Pal k is Linear Recognizable Online
• Episturmian words and some constructions of de Luca and Rauzy
• Periodic-like words, periodicity, and boxes

This page was built for publication: Palindromic rich words and run-length encodings