On theta-palindromic richness

From MaRDI portal
Publication:631773

DOI10.1016/J.TCS.2010.12.011zbMATH Open1211.68302arXiv1005.0722OpenAlexW2047842237MaRDI QIDQ631773FDOQ631773


Authors: Štěpán Starosta Edit this on Wikidata


Publication date: 14 March 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: In this paper we study generalization of the reversal mapping realized by an arbitrary involutory antimorphism Theta. It generalizes the notion of a palindrome into a Theta-palindrome -- a word invariant under Theta. For languages closed under Theta we give the relation between Theta-palindromic complexity and factor complexity. We generalize the notion of richness to Theta-richness and we prove analogous characterizations of words that are Theta-rich, especially in the case of set of factors invariant under Theta. A criterion for Theta-richness of Theta-episturmian words is given together with other examples of Theta-rich words.


Full work available at URL: https://arxiv.org/abs/1005.0722




Recommendations




Cites Work


Cited In (12)





This page was built for publication: On theta-palindromic richness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631773)