Palindromes and Sturmian words
Theoretical Computer Science
Episturmian words and some constructions of de Luca and Rauzy
Theoretical Computer Science
Factor versus palindromic complexity of uniformly recurrent infinite words
Theoretical Computer Science
On different generalizations of episturmian words
Theoretical Computer Science
European Journal of Combinatorics
European Journal of Combinatorics
A new characteristic property of rich words
Theoretical Computer Science
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Infinite words rich and almost rich in generalized palindromes
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Palindromic richness for languages invariant under more symmetries
Theoretical Computer Science
| Hi-index | 5.23 |
In this paper we study generalization of the reversal mapping realized by an arbitrary involutory antimorphism @Q. It generalizes the notion of a palindrome into a @Q-palindrome-a word invariant under @Q. For languages closed under @Q we give the relation between@Q-palindromic complexity and factor complexity. We generalize the notion of richness to@Q-richness and we prove analogous characterizations of words that are @Q-rich, especially in the case of set of factors invariant under @Q. A criterion for @Q-richness of @Q-episturmian words is given together with other examples of @Q-rich words.