On the fixed point of the iterated pseudopalindromic closure

Simple item page
dc.creatorJamet, D.
dc.creatorPaquin, G.
dc.creatorRichomme, G.
dc.creatorVuillon, L.
dc.date2009-04-24
dc.date.accessioned2026-07-07T13:08:26Z
dc.date.available2026-07-07T13:08:26Z
dc.descriptionFirst introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words with an infinity of pseudopalindromic prefixes, called pseudostandard words. We provide here several combinatorial properties of the fixed points under the iterated pseudopalindromic closure.
dc.descriptionSubmit to Words Conference 2009
dc.identifierhttps://arxiv.org/abs/0904.3828
dc.identifierhttp://arxiv.org/abs/0904.3828
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/228420
dc.subjectCombinatorics
dc.titleOn the fixed point of the iterated pseudopalindromic closure
dc.typetext

Files

Collections

arXiv