InforLorV4, PascalFrancis, Curation, bibRecord, 000C46

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

Identifieur interne : 000C46 ( PascalFrancis/Curation ); précédent : 000C45; suivant : 000C47

Minimal 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.

RBID : Pascal:97-0493797

Descripteurs français

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

English descriptors

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

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.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1295`
A08	`01`	`1`	`ENG`	`@1 Minimal letter frequency in n-th power-free binary words`
A09	`01`	`1`	`ENG`	`@1 MFCS '97 : mathematical foundations of computer science 1997 : Bratislava, August 25-29, 1997`
A11	`01`	`1`		`@1 KOLPAKOV (R.)`
A11	`02`	`1`		`@1 KUCHEROV (G.)`
A12	`01`	`1`		`@1 PRIVARA (Igor) @9 ed.`
A12	`02`	`1`		`@1 RUZICKA (Peter) @9 ed.`
A14	`01`			`@1 French-Russian Institute for Informatics and Applied Mathematics, Moscow University @2 119899 Moscow @3 RUS @Z 1 aut.`
A14	`02`			`@1 INRIA-Lorraine & CRIN, 615, rue du Jardin Botanique, B.P. 101 @2 54602 Villers-lès-Nancy @3 FRA @Z 2 aut.`
A20				`@1 347-357`
A21				`@1 1997`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-63437-1`
A43	`01`			`@1 INIST @2 16343 @5 354000068068640350`
A44				`@0 0000 @1 © 1997 INIST-CNRS. All rights reserved.`
A45				`@0 18 ref.`
A47	`01`	`1`		`@0 97-0493797`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
A66	`02`			`@0 USA`
C01	`01`		`ENG`	`@0 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.`
C02	`01`	`X`		`@0 001D02A02`
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 Théorie langage @5 02`
C03	`02`	`X`	`ENG`	`@0 Language theory @5 02`
C03	`02`	`X`	`SPA`	`@0 Teoría lenguaje @5 02`
C03	`03`	`X`	`FRE`	`@0 Langage formel @5 03`
C03	`03`	`X`	`ENG`	`@0 Formal language @5 03`
C03	`03`	`X`	`SPA`	`@0 Lenguaje formal @5 03`
N21				`@1 300`

A30	`01`	`1`	`ENG`	`@1 Mathematical foundations of computer science. International symposium @2 22 @3 Bratislava SVK @4 1997-08-25`

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

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000C33

Links to Exploration step

Pascal:97-0493797

Le 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>
</affiliation>
</author>
<author><name sortKey="Kucherov, G" sort="Kucherov, G" uniqKey="Kucherov G" first="G." last="Kucherov">G. Kucherov</name>
<affiliation wicri:level="1"><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>
</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>
</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>
</affiliation>
</author>
<author><name sortKey="Kucherov, G" sort="Kucherov, G" uniqKey="Kucherov G" first="G." last="Kucherov">G. Kucherov</name>
<affiliation wicri:level="1"><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>
</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><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1295</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Minimal letter frequency in n-th power-free binary words</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>MFCS '97 : mathematical foundations of computer science 1997 : Bratislava, August 25-29, 1997</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>KOLPAKOV (R.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>KUCHEROV (G.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>PRIVARA (Igor)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>RUZICKA (Peter)</s1>
<s9>ed.</s9>
</fA12>
<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>
</fA14>
<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>
</fA14>
<fA20><s1>347-357</s1>
</fA20>
<fA21><s1>1997</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-63437-1</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000068068640350</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1997 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>18 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>97-0493797</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A02</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>Théorie langage</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Language theory</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Teoría lenguaje</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Langage formel</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Formal language</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Lenguaje formal</s0>
<s5>03</s5>
</fC03>
<fN21><s1>300</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Mathematical foundations of computer science. International symposium</s1>
<s2>22</s2>
<s3>Bratislava SVK</s3>
<s4>1997-08-25</s4>
</fA30>
</pR>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

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

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000C46 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Curation
   |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.
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