arXiv Analytics

Sign in

arXiv:1108.3042 [math.CO]AbstractReferencesReviewsResources

Palindromic richness for languages invariant under more symmetries

Edita Pelantová, Štěpán Starosta

Published 2011-08-15, updated 2013-02-21Version 3

For a given finite group $G$ consisting of morphisms and antimorphisms of a free monoid $\mathcal{A}^*$, we study infinite words with language closed under the group $G$. We focus on the notion of $G$-richness which describes words rich in generalized palindromic factors, i.e., in factors $w$ satisfying $\Theta(w) = w$ for some antimorphism $\Theta \in G$. We give several equivalent descriptions which are generalizations of know characterizations of rich words (in the terms of classical palindromes) and show two examples of $G$-rich words.

Related articles: Most relevant | Search more
arXiv:1103.4051 [math.CO] (Published 2011-03-21, updated 2012-07-09)
Languages invariant under more symmetries: overlapping factors versus palindromic richness
arXiv:1107.0471 [math.CO] (Published 2011-07-03)
Factor frequencies in languages invariant under more symmetries
arXiv:1409.2354 [math.CO] (Published 2014-09-08)
Constructions of words rich in palindromes and pseudopalindromes