Minimal letter frequency in n -th power-free binary words
Identifieur interne : 00BC35 ( Main/Exploration ); précédent : 00BC34; suivant : 00BC36Minimal letter frequency in n -th power-free binary words
Auteurs : Roman Kolpakov [Russie] ; Gregory Kucherov [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
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 χ-th power-free for a real χ, if it does not contain subwords of exponent χ or more. We study the minimal proportion of one letter in an χ-th power-free binary word as a function of χ and prove, in particular, that this function is discontinuous.
Url:
DOI: 10.1007/BFb0029978
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003229
- to stream Istex, to step Curation: 003189
- to stream Istex, to step Checkpoint: 002768
- to stream Main, to step Merge: 00C413
- to stream PascalFrancis, to step Corpus: 000C33
- to stream PascalFrancis, to step Curation: 000C46
- to stream PascalFrancis, to step Checkpoint: 000C22
- to stream Main, to step Merge: 00C519
- to stream Main, to step Curation: 00BC35
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Minimal letter frequency in n -th power-free binary words</title><author><name sortKey="Kolpakov, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name></author><author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:D33A3EBA10232213B42FCC36A200CA081CD902A0</idno><date when="1997" year="1997">1997</date><idno type="doi">10.1007/BFb0029978</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-6K3G0BP4-F/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003229</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003229</idno><idno type="wicri:Area/Istex/Curation">003189</idno><idno type="wicri:Area/Istex/Checkpoint">002768</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002768</idno><idno type="wicri:doubleKey">0302-9743:1997:Kolpakov R:minimal:letter:frequency</idno><idno type="wicri:Area/Main/Merge">00C413</idno><idno type="wicri:source">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><idno type="wicri:Area/Main/Curation">00BC35</idno><idno type="wicri:Area/Main/Exploration">00BC35</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Minimal letter frequency in <hi rend="italic">n</hi>-th power-free binary words</title><author><name sortKey="Kolpakov, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name><affiliation wicri:level="3"><country xml:lang="fr">Russie</country><wicri:regionArea>French-Russian Institute for Informatics and Applied Mathematics, Moscow University, 119899, Moscow</wicri:regionArea><placeName><settlement type="city">Moscou</settlement><region>District fédéral central</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Russie</country></affiliation></author><author><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, B.P. 101, 54602, Villers-lés-Nancy</wicri:regionArea><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><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><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>Langage formel</term><term>Théorie langage</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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 χ-th power-free for a real χ, if it does not contain subwords of exponent χ or more. We study the minimal proportion of one letter in an χ-th power-free binary word as a function of χ 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, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name></region><name sortKey="Kolpakov, Roman" sort="Kolpakov, Roman" uniqKey="Kolpakov R" first="Roman" last="Kolpakov">Roman Kolpakov</name></country><country name="France"><region name="Grand Est"><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name></region><name sortKey="Kucherov, Gregory" sort="Kucherov, Gregory" uniqKey="Kucherov G" first="Gregory" last="Kucherov">Gregory Kucherov</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00BC35 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00BC35 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:D33A3EBA10232213B42FCC36A200CA081CD902A0
|texte= Minimal letter frequency in n -th power-free binary words
}}
| This area was generated with Dilib version V0.6.33. |  |