InforLorV4, PascalFrancis, Corpus, bibRecord, 000150

On the fixed points of the iterated pseudopalindromic closure operator

Identifieur interne : 000150 ( PascalFrancis/Corpus ); précédent : 000149; suivant : 000151

On the fixed points of the iterated pseudopalindromic closure operator

Auteurs : D. Jamet ; G. Paquin ; G. Richomme ; L. Vuillon

Source :

Theoretical computer science [ 0304-3975 ] ; 2011.

RBID : Pascal:11-0284467

Descripteurs français

Pascal (Inist)
- Informatique théorique, Point fixe, Virgule fixe, Opérateur fermeture, Fermeture, 37C25, 06A15, Mot sturmien, Préfixe, Propriété combinatoire.

English descriptors

KwdEn :
- Closure, Closure operator, Computer theory, Fix point, Fixed point.

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.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0304-3975`
A02	`01`			`@0 TCSCDI`
A03		`1`		`@0 Theor. comput. sci.`
A05				`@2 412`
A06				`@2 27`
A08	`01`	`1`	`ENG`	`@1 On the fixed points of the iterated pseudopalindromic closure operator`
A09	`01`	`1`	`ENG`	`@1 Combinatorics on Words (WORDS 2009)`
A11	`01`	`1`		`@1 JAMET (D.)`
A11	`02`	`1`		`@1 PAQUIN (G.)`
A11	`03`	`1`		`@1 RICHOMME (G.)`
A11	`04`	`1`		`@1 VUILLON (L.)`
A12	`01`	`1`		`@1 CARPI (Arturo) @9 ed.`
A12	`02`	`1`		`@1 DE FELICE (Clelia) @9 ed.`
A14	`01`			`@1 LORIA - Université Nancy 1 - CNRS, Campus Scientifique, BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut.`
A14	`02`			`@1 Laboratoire de mathématiques, CNRS UMR 5127, Université de Savoie @2 73376 Le Bourget-du-lac @3 FRA @Z 2 aut. @Z 4 aut.`
A14	`03`			`@1 UPJV, Laboratoire MIS, 33, Rue Saint Leu @2 80039 Amiens @3 FRA @Z 3 aut.`
A15	`01`			`@1 Dipartimento di Matematica e Informatica, Università di Perugia, via Vanvitelli 1 @2 06123, Perugia @3 ITA @Z 1 aut.`
A15	`02`			`@1 Dipartimento di Informatica, Università di Salerno, Via Ponte Don Melillo @2 84084 Fisciano (SA) @3 ITA @Z 2 aut.`
A20				`@1 2974-2987`
A21				`@1 2011`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17243 @5 354000191613490070`
A44				`@0 0000 @1 © 2011 INIST-CNRS. All rights reserved.`
A45				`@0 27 ref.`
A47	`01`	`1`		`@0 11-0284467`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Theoretical computer science`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	`@0 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.`
C02	`01`	`X`		`@0 001D02A08`
C02	`02`	`X`		`@0 001A02G04`
C02	`03`	`X`		`@0 001A02B02`
C03	`01`	`X`	`FRE`	`@0 Informatique théorique @5 01`
C03	`01`	`X`	`ENG`	`@0 Computer theory @5 01`
C03	`01`	`X`	`SPA`	`@0 Informática teórica @5 01`
C03	`02`	`X`	`FRE`	`@0 Point fixe @5 17`
C03	`02`	`X`	`ENG`	`@0 Fix point @5 17`
C03	`02`	`X`	`SPA`	`@0 Punto fijo @5 17`
C03	`03`	`X`	`FRE`	`@0 Virgule fixe @5 18`
C03	`03`	`X`	`ENG`	`@0 Fixed point @5 18`
C03	`03`	`X`	`SPA`	`@0 Coma fija @5 18`
C03	`04`	`3`	`FRE`	`@0 Opérateur fermeture @5 19`
C03	`04`	`3`	`ENG`	`@0 Closure operator @5 19`
C03	`05`	`X`	`FRE`	`@0 Fermeture @5 20`
C03	`05`	`X`	`ENG`	`@0 Closure @5 20`
C03	`05`	`X`	`SPA`	`@0 Cerradura @5 20`
C03	`06`	`X`	`FRE`	`@0 37C25 @4 INC @5 70`
C03	`07`	`X`	`FRE`	`@0 06A15 @4 INC @5 71`
C03	`08`	`X`	`FRE`	`@0 Mot sturmien @4 INC @5 72`
C03	`09`	`X`	`FRE`	`@0 Préfixe @4 INC @5 73`
C03	`10`	`X`	`FRE`	`@0 Propriété combinatoire @4 INC @5 74`
N21				`@1 192`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 11-0284467 INIST
ET :	On the fixed points of the iterated pseudopalindromic closure operator
AU :	JAMET (D.); PAQUIN (G.); RICHOMME (G.); VUILLON (L.); CARPI (Arturo); DE FELICE (Clelia)
AF :	LORIA - Université Nancy 1 - CNRS, Campus Scientifique, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut.); Laboratoire de mathématiques, CNRS UMR 5127, Université de Savoie/73376 Le Bourget-du-lac/France (2 aut., 4 aut.); UPJV, Laboratoire MIS, 33, Rue Saint Leu/80039 Amiens/France (3 aut.); Dipartimento di Matematica e Informatica, Università di Perugia, via Vanvitelli 1/06123, Perugia/Italie (1 aut.); Dipartimento di Informatica, Università di Salerno, Via Ponte Don Melillo/84084 Fisciano (SA)/Italie (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Royaume-Uni; Da. 2011; Vol. 412; No. 27; Pp. 2974-2987; Bibl. 27 ref.
LA :	Anglais
EA :	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.
CC :	001D02A08; 001A02G04; 001A02B02
FD :	Informatique théorique; Point fixe; Virgule fixe; Opérateur fermeture; Fermeture; 37C25; 06A15; Mot sturmien; Préfixe; Propriété combinatoire
ED :	Computer theory; Fix point; Fixed point; Closure operator; Closure
SD :	Informática teórica; Punto fijo; Coma fija; Cerradura
LO :	INIST-17243.354000191613490070
ID :	11-0284467

Links to Exploration step

Pascal:11-0284467

Le 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><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>
</affiliation>
</author>
<author><name sortKey="Paquin, G" sort="Paquin, G" uniqKey="Paquin G" first="G." last="Paquin">G. Paquin</name>
<affiliation><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>
</affiliation>
</author>
<author><name sortKey="Richomme, G" sort="Richomme, G" uniqKey="Richomme G" first="G." last="Richomme">G. Richomme</name>
<affiliation><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>
</affiliation>
</author>
<author><name sortKey="Vuillon, L" sort="Vuillon, L" uniqKey="Vuillon L" first="L." last="Vuillon">L. Vuillon</name>
<affiliation><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>
</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>
</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><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>
</affiliation>
</author>
<author><name sortKey="Paquin, G" sort="Paquin, G" uniqKey="Paquin G" first="G." last="Paquin">G. Paquin</name>
<affiliation><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>
</affiliation>
</author>
<author><name sortKey="Richomme, G" sort="Richomme, G" uniqKey="Richomme G" first="G." last="Richomme">G. Richomme</name>
<affiliation><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>
</affiliation>
</author>
<author><name sortKey="Vuillon, L" sort="Vuillon, L" uniqKey="Vuillon L" first="L." last="Vuillon">L. Vuillon</name>
<affiliation><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>
</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>
<server><NO>PASCAL 11-0284467 INIST</NO>
<ET>On the fixed points of the iterated pseudopalindromic closure operator</ET>
<AU>JAMET (D.); PAQUIN (G.); RICHOMME (G.); VUILLON (L.); CARPI (Arturo); DE FELICE (Clelia)</AU>
<AF>LORIA - Université Nancy 1 - CNRS, Campus Scientifique, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut.); Laboratoire de mathématiques, CNRS UMR 5127, Université de Savoie/73376 Le Bourget-du-lac/France (2 aut., 4 aut.); UPJV, Laboratoire MIS, 33, Rue Saint Leu/80039 Amiens/France (3 aut.); Dipartimento di Matematica e Informatica, Università di Perugia, via Vanvitelli 1/06123, Perugia/Italie (1 aut.); Dipartimento di Informatica, Università di Salerno, Via Ponte Don Melillo/84084 Fisciano (SA)/Italie (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Royaume-Uni; Da. 2011; Vol. 412; No. 27; Pp. 2974-2987; Bibl. 27 ref.</SO>
<LA>Anglais</LA>
<EA>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.</EA>
<CC>001D02A08; 001A02G04; 001A02B02</CC>
<FD>Informatique théorique; Point fixe; Virgule fixe; Opérateur fermeture; Fermeture; 37C25; 06A15; Mot sturmien; Préfixe; Propriété combinatoire</FD>
<ED>Computer theory; Fix point; Fixed point; Closure operator; Closure</ED>
<SD>Informática teórica; Punto fijo; Coma fija; Cerradura</SD>
<LO>INIST-17243.354000191613490070</LO>
<ID>11-0284467</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000150 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000150 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |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.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

On the fixed points of the iterated pseudopalindromic closure operator

On the fixed points of the iterated pseudopalindromic closure operator

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri