On the fixed points of the iterated pseudopalindromic closure operator
Identifieur interne : 000863 ( PascalFrancis/Curation ); précédent : 000862; suivant : 000864On the fixed points of the iterated pseudopalindromic closure operator
Auteurs : D. Jamet [France] ; G. Paquin [France] ; G. Richomme [France] ; L. Vuillon [France]Source :
- Theoretical computer science [ 0304-3975 ] ; 2011.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
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.
pA |
|
---|
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000150
Links to Exploration step
Pascal:11-0284467Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On the fixed points of the iterated pseudopalindromic closure operator</title>
<author><name sortKey="Jamet, D" sort="Jamet, D" uniqKey="Jamet D" first="D." last="Jamet">D. Jamet</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA - Université Nancy 1 - CNRS, Campus Scientifique, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Paquin, G" sort="Paquin, G" uniqKey="Paquin G" first="G." last="Paquin">G. Paquin</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Laboratoire de mathématiques, CNRS UMR 5127, Université de Savoie</s1>
<s2>73376 Le Bourget-du-lac</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Richomme, G" sort="Richomme, G" uniqKey="Richomme G" first="G." last="Richomme">G. Richomme</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>UPJV, Laboratoire MIS, 33, Rue Saint Leu</s1>
<s2>80039 Amiens</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Vuillon, L" sort="Vuillon, L" uniqKey="Vuillon L" first="L." last="Vuillon">L. Vuillon</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Laboratoire de mathématiques, CNRS UMR 5127, Université de Savoie</s1>
<s2>73376 Le Bourget-du-lac</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">11-0284467</idno>
<date when="2011">2011</date>
<idno type="stanalyst">PASCAL 11-0284467 INIST</idno>
<idno type="RBID">Pascal:11-0284467</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000150</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000863</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On the fixed points of the iterated pseudopalindromic closure operator</title>
<author><name sortKey="Jamet, D" sort="Jamet, D" uniqKey="Jamet D" first="D." last="Jamet">D. Jamet</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>LORIA - Université Nancy 1 - CNRS, Campus Scientifique, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Paquin, G" sort="Paquin, G" uniqKey="Paquin G" first="G." last="Paquin">G. Paquin</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Laboratoire de mathématiques, CNRS UMR 5127, Université de Savoie</s1>
<s2>73376 Le Bourget-du-lac</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Richomme, G" sort="Richomme, G" uniqKey="Richomme G" first="G." last="Richomme">G. Richomme</name>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>UPJV, Laboratoire MIS, 33, Rue Saint Leu</s1>
<s2>80039 Amiens</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Vuillon, L" sort="Vuillon, L" uniqKey="Vuillon L" first="L." last="Vuillon">L. Vuillon</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Laboratoire de mathématiques, CNRS UMR 5127, Université de Savoie</s1>
<s2>73376 Le Bourget-du-lac</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="2011">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Closure</term>
<term>Closure operator</term>
<term>Computer theory</term>
<term>Fix point</term>
<term>Fixed point</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term>
<term>Point fixe</term>
<term>Virgule fixe</term>
<term>Opérateur fermeture</term>
<term>Fermeture</term>
<term>37C25</term>
<term>06A15</term>
<term>Mot sturmien</term>
<term>Préfixe</term>
<term>Propriété combinatoire</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0304-3975</s0>
</fA01>
<fA02 i1="01"><s0>TCSCDI</s0>
</fA02>
<fA03 i2="1"><s0>Theor. comput. sci.</s0>
</fA03>
<fA05><s2>412</s2>
</fA05>
<fA06><s2>27</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>On the fixed points of the iterated pseudopalindromic closure operator</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Combinatorics on Words (WORDS 2009)</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>JAMET (D.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>PAQUIN (G.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>RICHOMME (G.)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>VUILLON (L.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>CARPI (Arturo)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>DE FELICE (Clelia)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA - Université Nancy 1 - CNRS, Campus Scientifique, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Laboratoire de mathématiques, CNRS UMR 5127, Université de Savoie</s1>
<s2>73376 Le Bourget-du-lac</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>UPJV, Laboratoire MIS, 33, Rue Saint Leu</s1>
<s2>80039 Amiens</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>Dipartimento di Matematica e Informatica, Università di Perugia, via Vanvitelli 1</s1>
<s2>06123, Perugia</s2>
<s3>ITA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02"><s1>Dipartimento di Informatica, Università di Salerno, Via Ponte Don Melillo</s1>
<s2>84084 Fisciano (SA)</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20><s1>2974-2987</s1>
</fA20>
<fA21><s1>2011</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000191613490070</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2011 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>27 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>11-0284467</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01"><s0>GBR</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A08</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001A02G04</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001A02B02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Point fixe</s0>
<s5>17</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Fix point</s0>
<s5>17</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Punto fijo</s0>
<s5>17</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Virgule fixe</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Fixed point</s0>
<s5>18</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Coma fija</s0>
<s5>18</s5>
</fC03>
<fC03 i1="04" i2="3" l="FRE"><s0>Opérateur fermeture</s0>
<s5>19</s5>
</fC03>
<fC03 i1="04" i2="3" l="ENG"><s0>Closure operator</s0>
<s5>19</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Fermeture</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Closure</s0>
<s5>20</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Cerradura</s0>
<s5>20</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>37C25</s0>
<s4>INC</s4>
<s5>70</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>06A15</s0>
<s4>INC</s4>
<s5>71</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Mot sturmien</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Préfixe</s0>
<s4>INC</s4>
<s5>73</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Propriété combinatoire</s0>
<s4>INC</s4>
<s5>74</s5>
</fC03>
<fN21><s1>192</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000863 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000863 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= PascalFrancis |étape= Curation |type= RBID |clé= Pascal:11-0284467 |texte= On the fixed points of the iterated pseudopalindromic closure operator }}
This area was generated with Dilib version V0.6.33. |