Palindromic rich words and run-length encodings
From MaRDI portal
Publication:738876
Abstract: We prove a number of results on the structure and enumeration of palindromes and antipalindromes. In particular, we study conjugates of palindromes, palindromic pairs, rich words, and the counterparts of these notions for antipalindromes.
Recommendations
- Palindromic factorization of rich words
- Infinite words rich and almost rich in generalized palindromes
- Palindromic richness
- Generalized Thue-Morse words and palindromic richness
- Constructions of words rich in palindromes and pseudopalindromes
- Burrows-Wheeler transform and palindromic richness
- Identifying approximate palindromes in run-length encoded strings
- Upper bound for palindromic and factor complexity of rich words
- Efficient retrieval of approximate palindromes in a run-length encoded string
- Palindromic subsequences in finite words
Cites work
- scientific article; zbMATH DE number 2126631 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- A Linear-Time On-Line Recognition Algorithm for ``Palstar
- Episturmian words and some constructions of de Luca and Rauzy
- Fast Pattern Matching in Strings
- Growth properties of power-free languages
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- On intermediate factorial languages
- On the number of closed factors in a word
- Palindromic richness
- Periodic-like words, periodicity, and boxes
- Rich and Periodic-Like Words
- Rich, Sturmian, and trapezoidal words
- \(\mathrm{Pal}^{k}\) is linear recognizable online
Cited in
(17)- Block reversal on finite words
- Palindromic factorization of rich words
- On Morphisms Preserving Palindromic Richness
- On highly palindromic words: the ternary case
- Ostrowski-automatic sequences: theory and applications
- Palindromic length of words and morphisms in class \(\mathcal{P}\)
- Counting palindromes in substrings
- Rich square-free words
- On k-Abelian Palindromic Rich and Poor Words
- Upper bound for palindromic and factor complexity of rich words
- Palindromic richness for languages invariant under more symmetries
- Rich words in the block reversal of a word
- On generalized highly potential words
- On the number of rich words
- Palindromic richness
- Improved estimates for the number of privileged words
- Rich words containing two given factors
This page was built for publication: Palindromic rich words and run-length encodings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q738876)
