Abstract: In this paper we study generalization of the reversal mapping realized by an arbitrary involutory antimorphism . It generalizes the notion of a palindrome into a -palindrome -- a word invariant under . For languages closed under we give the relation between -palindromic complexity and factor complexity. We generalize the notion of richness to -richness and we prove analogous characterizations of words that are -rich, especially in the case of set of factors invariant under . A criterion for -richness of -episturmian words is given together with other examples of -rich words.
Recommendations
Cites work
- A connection between palindromic and factor complexity using return words
- A new characteristic property of rich words
- Episturmian words and some constructions of de Luca and Rauzy
- Episturmian words: a survey
- Factor versus palindromic complexity of uniformly recurrent infinite words
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- On \(\theta\)-episturmian words
- On different generalizations of episturmian words
- Palindromes and Sturmian words
- Palindromic complexity of infinite words associated with simple Parry numbers
- Palindromic richness
- Sturmian and Episturmian Words
- Sturmian jungle (or garden?) On multiliteral alphabets
Cited in
(12)- Enumeration of two dimensional palindromes
- Twin-roots of words and their properties
- Infinite words rich and almost rich in generalized palindromes
- A relation by palindromic subwords
- Theta palindromes in theta conjugates
- Pseudopalindrome closure operators in free monoids
- Generalized Thue-Morse words and palindromic richness
- Reconstructing words from a \(\sigma\)-palindromic language
- ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS
- Languages invariant under more symmetries: overlapping factors versus palindromic richness
- Palindromic richness for languages invariant under more symmetries
- Palindromic closures using multiple antimorphisms
This page was built for publication: On theta-palindromic richness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631773)