Palindromic rich words and run-length encodings
From MaRDI portal
Publication:738876
DOI10.1016/J.IPL.2016.07.001zbMATH Open1371.68221arXiv1503.09112OpenAlexW1492505833WikidataQ60692197 ScholiaQ60692197MaRDI QIDQ738876FDOQ738876
Authors: Chuan Guo, Arseny M. Shur, Jeffrey Shallit 
Publication date: 16 August 2016
Published in: Information Processing Letters (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1503.09112
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
- Title not available (Why is that?)
- EERTREE: an efficient data structure for processing palindromes in strings
- Palindromic richness
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Title not available (Why is that?)
- Episturmian words and some constructions of de Luca and Rauzy
- Fast Pattern Matching in Strings
- Rich, Sturmian, and trapezoidal words
- A Linear-Time On-Line Recognition Algorithm for ``Palstar
- Growth properties of power-free languages
- Rich and Periodic-Like Words
- Periodic-like words, periodicity, and boxes
- On intermediate factorial languages
- On the number of closed factors in a word
- \(\mathrm{Pal}^{k}\) is linear recognizable online
Cited In (17)
- On the number of rich words
- Rich words containing two given factors
- Palindromic richness
- Upper bound for palindromic and factor complexity of rich words
- Block reversal on finite words
- Palindromic factorization of rich words
- Ostrowski-automatic sequences: theory and applications
- On generalized highly potential words
- Improved estimates for the number of privileged words
- On k-Abelian Palindromic Rich and Poor Words
- On highly palindromic words: the ternary case
- Palindromic length of words and morphisms in class \(\mathcal{P}\)
- Rich square-free words
- Rich words in the block reversal of a word
- On Morphisms Preserving Palindromic Richness
- Palindromic richness for languages invariant under more symmetries
- Counting palindromes in substrings
Uses Software
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)
