Rich words in the block reversal of a word

DOI10.1016/J.DAM.2023.03.013arXiv2302.02109MaRDI QIDQ6157425FDOQ6157425

Authors: Kalpana Mahalingam, Anuran Maity, Palak Pandoh 

Publication date: 11 May 2023

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

Abstract: The block reversal of a word $w$, denoted by $mathttBR(w)$, is a generalization of the concept of the reversal of a word, obtained by concatenating the blocks of the word in the reverse order. We characterize non-binary and binary words whose block reversal contains only rich words. We prove that for a binary word $w$, richness of all elements of $mathttBR(w)$ depends on $l(w)$, the length of the run sequence of $w$. We show that if all elements of $mathttBR(w)$ are rich, then $2leql(w)leq8$. We also provide the structure of such words.

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

Recommendations

• Block reversal on finite words
• scientific article; zbMATH DE number 3896916
• A unique extension of rich words
• Rich square-free words
• Extensions of rich words
• ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS
• On the number of rich words
• Inverses of words
• Towards the inverse of a word
• Palindromic factorization of rich words

zbMATH Keywords

combinatorics on wordsrich wordsrun-length encodingblock reversal

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Palindromic richness
• Palindrome complexity.
• Episturmian words and some constructions of de Luca and Rauzy
• Uniformly growing k-th power-free homomorphisms
• Title not available (Why is that?)
• Efficient string-matching allowing for non-overlapping inversions
• Total palindrome complexity of finite words
• On the least number of palindromes in two-dimensional words
• On the least number of palindromes contained in an infinite word
• A local algorithm for DNA sequence alignment with inversions
• A space-efficient algorithm for sequence alignment with inversions and reversals
• Balancing and clustering of words in the Burrows-Wheeler transform
• Palindromic complexity of codings of rotations
• Palindromic rich words and run-length encodings
• Non-overlapping inversion on strings and languages
• Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
• Balanced Words Having Simple Burrows-Wheeler Transform
• Block reversal on finite words
• Theta palindromes in theta conjugates
• Sequence searching allowing for non-overlapping adjacent unbalanced translocations
• LR property of non-well-formed scales
• Perfect balance and circularly rich words

Cited In (2)

• Towards the inverse of a word
• Smallest and Largest Block Palindrome Factorizations

This page was built for publication: Rich words in the block reversal of a word

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157425)