We focus on Θ-rich and almost Θ-rich words over a finite alphabet , where Θ is an involutive antimorphism over . We show that any recurrent almost Θ-rich word u is an image of a recurrent Θ′-rich word under a suitable morphism, where Θ′ is again an involutive antimorphism. Moreover, if the word u is uniformly recurrent, we show that Θ′ can be set to the reversal mapping. We also treat one special case of almost Θ-rich words. We show that every Θ-standard word with seed is an image of an Arnoux-Rauzy word. © 2011 Springer-Verlag.
CITATION STYLE
Pelantová, E., & Starosta, Š. (2011). Infinite words rich and almost rich in generalized palindromes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 406–416). https://doi.org/10.1007/978-3-642-22321-1_35
Mendeley helps you to discover research relevant for your work.