On theta-palindromic richness

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F11%3A00173063" target="_blank" >RIV/68407700:21340/11:00173063 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.tcs.2010.12.011" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2010.12.011</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.tcs.2010.12.011" target="_blank" >10.1016/j.tcs.2010.12.011</a>

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

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)