Smooth Words on a 2-letter alphabets having same parity
Identifieur interne : 004648 ( Main/Merge ); précédent : 004647; suivant : 004649Smooth Words on a 2-letter alphabets having same parity
Auteurs : Srecko Brlek [Canada] ; Damien Jamet [France] ; Geneviève Paquin [Canada]Source :
- Theoretical Computer Science [ 0304-3975 ] ; 2008.
English descriptors
Abstract
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that the closure of the set of factors under reversal holds for odd alphabets only. We provide a linear time algorithm computing the extremal words, w.r.t. lexicographic order. The minimal word is an infinite Lyndon word if and only if either a = 1 and b odd, or a, b are even. A connection is established between generalized Kolakoski words and maximal infinite smooth words over even 2-letter alphabets revealing new properties for some of the generalized Kolakoski words. Finally, the frequency of letters in extremal words is 1/2 for even alphabets, and for a = 1 with b odd, the frequency of b's is 1/(√2b − 1 + 1).
Url:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 004604
- to stream Hal, to step Curation: 004604
- to stream Hal, to step Checkpoint: 003545
Links to Exploration step
Hal:hal-00579854Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Smooth Words on a 2-letter alphabets having same parity</title>
<author><name sortKey="Brlek, Srecko" sort="Brlek, Srecko" uniqKey="Brlek S" first="Srecko" last="Brlek">Srecko Brlek</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID"><orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><country key="CA"></country>
</address>
</desc>
<listRelation><relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-360045" type="direct"><org type="institution" xml:id="struct-360045" status="VALID"><orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Jamet, Damien" sort="Jamet, Damien" uniqKey="Jamet D" first="Damien" last="Jamet">Damien Jamet</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-22019" status="OLD"><orgName>Applying Discrete Algorithms to Genomics and Imagery</orgName>
<orgName type="acronym">ADAGIO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/adagio</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Paquin, Genevieve" sort="Paquin, Genevieve" uniqKey="Paquin G" first="Geneviève" last="Paquin">Geneviève Paquin</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID"><orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><country key="CA"></country>
</address>
</desc>
<listRelation><relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-360045" type="direct"><org type="institution" xml:id="struct-360045" status="VALID"><orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00579854</idno>
<idno type="halId">hal-00579854</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00579854</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-00579854</idno>
<date when="2008">2008</date>
<idno type="wicri:Area/Hal/Corpus">004604</idno>
<idno type="wicri:Area/Hal/Curation">004604</idno>
<idno type="wicri:Area/Hal/Checkpoint">003545</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">003545</idno>
<idno type="wicri:doubleKey">0304-3975:2008:Brlek S:smooth:words:on</idno>
<idno type="wicri:Area/Main/Merge">004648</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Smooth Words on a 2-letter alphabets having same parity</title>
<author><name sortKey="Brlek, Srecko" sort="Brlek, Srecko" uniqKey="Brlek S" first="Srecko" last="Brlek">Srecko Brlek</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID"><orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><country key="CA"></country>
</address>
</desc>
<listRelation><relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-360045" type="direct"><org type="institution" xml:id="struct-360045" status="VALID"><orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Jamet, Damien" sort="Jamet, Damien" uniqKey="Jamet D" first="Damien" last="Jamet">Damien Jamet</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-22019" status="OLD"><orgName>Applying Discrete Algorithms to Genomics and Imagery</orgName>
<orgName type="acronym">ADAGIO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche/equipes/adagio</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
<author><name sortKey="Paquin, Genevieve" sort="Paquin, Genevieve" uniqKey="Paquin G" first="Geneviève" last="Paquin">Geneviève Paquin</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID"><orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><country key="CA"></country>
</address>
</desc>
<listRelation><relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-360045" type="direct"><org type="institution" xml:id="struct-360045" status="VALID"><orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
</analytic>
<series><title level="j">Theoretical Computer Science</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date type="datePub">2008</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Kolakoski word</term>
<term>Lyndon factorization</term>
<term>Smooth words</term>
<term>letter frequency</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that the closure of the set of factors under reversal holds for odd alphabets only. We provide a linear time algorithm computing the extremal words, w.r.t. lexicographic order. The minimal word is an infinite Lyndon word if and only if either a = 1 and b odd, or a, b are even. A connection is established between generalized Kolakoski words and maximal infinite smooth words over even 2-letter alphabets revealing new properties for some of the generalized Kolakoski words. Finally, the frequency of letters in extremal words is 1/2 for even alphabets, and for a = 1 with b odd, the frequency of b's is 1/(√2b − 1 + 1).</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 004648 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 004648 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Merge |type= RBID |clé= Hal:hal-00579854 |texte= Smooth Words on a 2-letter alphabets having same parity }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |