Episturmian words and some constructions of de Luca and Rauzy
Theoretical Computer Science
Theoretical Computer Science
Palindromic prefixes and episturmian words
Journal of Combinatorial Theory Series A
Note: Rich, Sturmian, and trapezoidal words
Theoretical Computer Science
European Journal of Combinatorics
Burrows-Wheeler transform and palindromic richness
Theoretical Computer Science
Theoretical Computer Science
Balancing and clustering of words in the Burrows-Wheeler transform
Theoretical Computer Science
On the least number of palindromes contained in an infinite word
Theoretical Computer Science
Palindromic richness for languages invariant under more symmetries
Theoretical Computer Science
Hi-index | 5.23 |
Originally introduced and studied by the third and fourth authors together with J. Justin and S. Widmer (2008), rich words constitute a new class of finite and infinite words characterized by containing the maximal number of distinct palindromes. Several characterizations of rich words have already been established. A particularly nice characteristic property is that all 'complete returns' to palindromes are palindromes. In this note, we prove that rich words are also characterized by the property that each factor is uniquely determined by its longest palindromic prefix and its longest palindromic suffix.