On the fixed points of the iterated pseudopalindromic closure operator

Damien Jamet; Geneviève Paquin; Gwenael Richomme; Laurent Vuillon

hal-00580665, version 1

On the fixed points of the iterated pseudopalindromic closure operator

Damien Jamet () ¹, Geneviève Paquin () ², Gwenael Richomme ³, Laurent Vuillon () ⁴

Theoretical Computer Science 412, 27 (2011) 2974-2987

Abstract: First introduced in the study of the Sturmian words by de Luca in 1997, iterated palindromic closure was generalized to pseudopalindromes by de Luca and De Luca in 2006. This operator allows one to construct words with infinitely many pseudopalindromic prefixes, called pseudostandard words. We provide here several combinatorial properties of the fixed points under iterated pseudopalindromic closure.

1: ADAGIO (LORIA)
CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – INRIA – Institut National Polytechnique de Lorraine (INPL)
2: Département d'informatique [Canada] (UQAM)
Université du Québec à Montréal
3: Laboratoire de Recherche en Informatique d'Amiens (LaRIA)
CNRS : FRE2733 – Université de Picardie Jules Verne
4: Laboratoire de Mathématiques (LAMA)
CNRS : UMR5127 – Université de Savoie

hal-00580665, version 1
http://hal.archives-ouvertes.fr/hal-00580665
oai:hal.archives-ouvertes.fr:hal-00580665
From: Damien Jamet <>
Submitted on: Monday, 28 March 2011 22:20:54
Updated on: Monday, 6 June 2011 18:40:05

See detailed view

Associated documents

PDF :

DOI: 10.1016/j.tcs.2010.03.018

Export

Bibtex EndNote TEI RefWorks

<?xml version="1.0" encoding="UTF-8"?>
<listBibl xmlns="http://www.tei-c.org/ns/1.0" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML">
<listBibl type="article"><head>Articles in peer-reviewed journal</head>
<biblStruct type="article" xml:id="hal-00580665"><analytic>
<author><persName><forename>Damien</forename><surname>Jamet</surname></persName>
<affiliation>
<orgName type="laboratory">LORIA</orgName>
<orgName type="team">ADAGIO</orgName>
<country>FR</country>
<orgName type="institution">CNRS : UMR7503</orgName>
<orgName type="institution">Université Henri Poincaré - Nancy I</orgName>
<orgName type="institution">Université Nancy II</orgName>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">Institut National Polytechnique de Lorraine (INPL)</orgName>
</affiliation>
</author>
<author><persName><forename>Geneviève</forename><surname>Paquin</surname></persName>
<affiliation>
<orgName type="laboratory">UQAM</orgName>
<orgName type="team">Département d'informatique [Canada]</orgName>
<country>CA</country>
<orgName type="institution">Université du Québec à Montréal</orgName>
</affiliation>
</author>
<author><persName><forename>Gwenael</forename><surname>Richomme</surname></persName>
<affiliation>
<orgName type="laboratory">LaRIA</orgName>
<orgName type="team">Laboratoire de Recherche en Informatique d'Amiens</orgName>
<country>FR</country>
<orgName type="institution">CNRS : FRE2733</orgName>
<orgName type="institution">Université de Picardie Jules Verne</orgName>
</affiliation>
</author>
<author><persName><forename>Laurent</forename><surname>Vuillon</surname></persName>
<affiliation>
<orgName type="laboratory">LAMA</orgName>
<orgName type="team">Laboratoire de Mathématiques</orgName>
<country>FR</country>
<orgName type="institution">CNRS : UMR5127</orgName>
<orgName type="institution">Université de Savoie</orgName>
</affiliation>
</author>
<title type="main" level="a">On the fixed points of the iterated pseudopalindromic closure operator</title></analytic><monogr><title level="j" type="main">Theoretical Computer Science</title><imprint><biblScope type="publicationDate">2011-06-16</biblScope><biblScope type="vol">412</biblScope><biblScope type="issue">27</biblScope><biblScope type="pp">2974-2987</biblScope></imprint></monogr><idno type="doi">10.1016/j.tcs.2010.03.018</idno><idno type="HALid">http://hal.archives-ouvertes.fr/hal-00580665</idno><idno type="HALFile">http://hal.archives-ouvertes.fr/hal-00580665/PDF/modif2.pdf</idno></biblStruct>
</listBibl>
</listBibl>