Rich words in the block reversal of a word
From MaRDI portal
Publication:6157425
DOI10.1016/j.dam.2023.03.013arXiv2302.02109MaRDI QIDQ6157425
Anuran Maity, Kalpana Mahalingam, Palak Pandoh
Publication date: 11 May 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.02109
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the least number of palindromes contained in an infinite word
- Efficient string-matching allowing for non-overlapping inversions
- Non-overlapping inversion on strings and languages
- Balancing and clustering of words in the Burrows-Wheeler transform
- Palindromic complexity of codings of rotations
- Palindromic rich words and run-length encodings
- Palindromic richness
- Total palindrome complexity of finite words
- A local algorithm for DNA sequence alignment with inversions
- Uniformly growing k-th power-free homomorphisms
- Palindrome complexity.
- A space-efficient algorithm for sequence alignment with inversions and reversals
- Theta palindromes in theta conjugates
- Block reversal on finite words
- On the least number of palindromes in two-dimensional words
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- LR property of non-well-formed scales
- Balanced Words Having Simple Burrows-Wheeler Transform
- Perfect balance and circularly rich words
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: Rich words in the block reversal of a word
