InforLorV4, Main, Curation, bibRecord, 00BC35

Minimal letter frequency in n -th power-free binary words

Identifieur interne : 00BC35 ( Main/Curation ); précédent : 00BC34; suivant : 00BC36

Minimal letter frequency in n -th power-free binary words

Auteurs : Roman Kolpakov [Russie] ; Gregory Kucherov [France]

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:D33A3EBA10232213B42FCC36A200CA081CD902A0

Descripteurs français

Pascal (Inist)
- Informatique théorique, Langage formel, Théorie langage.

English descriptors

KwdEn :
- Computer theory, Formal language, Language theory.

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:

https://api.istex.fr/ark:/67375/HCB-6K3G0BP4-F/fulltext.pdf

DOI: 10.1007/BFb0029978

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003229
to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :003189
to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :002768
to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :00C413
to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000C33
to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000C46
to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000C22
to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :00C519

Links to Exploration step

ISTEX:D33A3EBA10232213B42FCC36A200CA081CD902A0

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>
</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>
<double idat="0302-9743:1997:Kolpakov R:minimal:letter:frequency"><INIST><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>
</INIST>
<ISTEX><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>
</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></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>
</ISTEX>
</double>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Curation

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

HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/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=   Curation
   |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.
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

Minimal letter frequency in n -th power-free binary words

Minimal letter frequency in n -th power-free binary words

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

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