Minimal letter frequency in n-th power-free binary words
Identifieur interne : 00C519 ( Main/Merge ); précédent : 00C518; suivant : 00C520Minimal letter frequency in n-th power-free binary words
Auteurs : R. Kolpakov [Russie] ; G. Kucherov [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 1997.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
We show that the minimal proportion of one letter in an n-th power-free binary word is asymptotically 1/n. We also consider a generalization of n-th power-free words defined through the notion of exponent: a word is x-th power-free for a real x, if it does not contain subwords of exponent x or more. We study the minimal proportion of one letter in an x-th power-free binary word as a function of x and prove, in particular, that this function is discontinuous.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000C33
- to stream PascalFrancis, to step Curation: 000C46
- to stream PascalFrancis, to step Checkpoint: 000C22
Links to Exploration step
Pascal:97-0493797Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Minimal letter frequency in n-th power-free binary words</title><author><name sortKey="Kolpakov, R" sort="Kolpakov, R" uniqKey="Kolpakov R" first="R." last="Kolpakov">R. Kolpakov</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>French-Russian Institute for Informatics and Applied Mathematics, Moscow University</s1><s2>119899 Moscow</s2><s3>RUS</s3><sZ>1 aut.</sZ></inist:fA14><country>Russie</country><placeName><settlement type="city">Moscou</settlement><region>District fédéral central</region></placeName></affiliation></author><author><name sortKey="Kucherov, G" sort="Kucherov, G" uniqKey="Kucherov G" first="G." last="Kucherov">G. Kucherov</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, B.P. 101</s1><s2>54602 Villers-lès-Nancy </s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy </settlement></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">97-0493797</idno><date when="1997">1997</date><idno type="stanalyst">PASCAL 97-0493797 INIST</idno><idno type="RBID">Pascal:97-0493797</idno><idno type="wicri:Area/PascalFrancis/Corpus">000C33</idno><idno type="wicri:Area/PascalFrancis/Curation">000C46</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000C22</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000C22</idno><idno type="wicri:doubleKey">0302-9743:1997:Kolpakov R:minimal:letter:frequency</idno><idno type="wicri:Area/Main/Merge">00C519</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Minimal letter frequency in n-th power-free binary words</title><author><name sortKey="Kolpakov, R" sort="Kolpakov, R" uniqKey="Kolpakov R" first="R." last="Kolpakov">R. Kolpakov</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>French-Russian Institute for Informatics and Applied Mathematics, Moscow University</s1><s2>119899 Moscow</s2><s3>RUS</s3><sZ>1 aut.</sZ></inist:fA14><country>Russie</country><placeName><settlement type="city">Moscou</settlement><region>District fédéral central</region></placeName></affiliation></author><author><name sortKey="Kucherov, G" sort="Kucherov, G" uniqKey="Kucherov G" first="G." last="Kucherov">G. Kucherov</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, B.P. 101</s1><s2>54602 Villers-lès-Nancy </s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy </settlement></placeName></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="1997">1997</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer theory</term><term>Formal language</term><term>Language theory</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Informatique théorique</term><term>Théorie langage</term><term>Langage formel</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We show that the minimal proportion of one letter in an n-th power-free binary word is asymptotically 1/n. We also consider a generalization of n-th power-free words defined through the notion of exponent: a word is x-th power-free for a real x, if it does not contain subwords of exponent x or more. We study the minimal proportion of one letter in an x-th power-free binary word as a function of x and prove, in particular, that this function is discontinuous.</div></front></TEI><affiliations><list><country><li>France</li><li>Russie</li></country><region><li>District fédéral central</li><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Moscou</li><li>Villers-lès-Nancy </li></settlement></list><tree><country name="Russie"><region name="District fédéral central"><name sortKey="Kolpakov, R" sort="Kolpakov, R" uniqKey="Kolpakov R" first="R." last="Kolpakov">R. Kolpakov</name></region></country><country name="France"><region name="Grand Est"><name sortKey="Kucherov, G" sort="Kucherov, G" uniqKey="Kucherov G" first="G." last="Kucherov">G. Kucherov</name></region></country></tree></affiliations></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 00C519 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00C519 | 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é= Pascal:97-0493797
|texte= Minimal letter frequency in n-th power-free binary words
}}
| This area was generated with Dilib version V0.6.33. |  |