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

Roman Kolpakov, Gregory Kucherov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 1997 - 22nd International Symposium, MFCS 1997, Proceedings
EditorsIgor Privara, Peter Ruzicka
PublisherSpringer Verlag
Pages347-357
Number of pages11
ISBN (Print)3540634371, 9783540634379
DOIs
Publication statusPublished - 1997
Externally publishedYes
Event22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997 - Bratislava, Slovakia
Duration: 25 Aug 199729 Aug 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1295
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997
Country/TerritorySlovakia
CityBratislava
Period25/08/9729/08/97

Fingerprint

Dive into the research topics of 'Minimal letter frequency in n-th power-Free binary words'. Together they form a unique fingerprint.

Cite this