Article ID Journal Published Year Pages File Type
436667 Theoretical Computer Science 2014 22 Pages PDF
Abstract

For a given finite group G   consisting of morphisms and antimorphisms of a free monoid A⁎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Θ(w)=w for some antimorphism Θ∈GΘ∈G. We give several equivalent descriptions which are generalizations of known characterizations of rich words (in the terms of classical palindromes) and show two examples of G-rich words.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,