Palindromic richness for languages invariant under more symmetries
Abstract
For a given finite group G consisting of morphisms and antimorphisms of a free monoid 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 (w) = w for some antimorphism ∈ 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.