@inproceedings{4646190ef8d34cfa9adfb5fd063fa233,

title = "Minimal letter frequency in n-th power-Free binary words",

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.",

author = "Roman Kolpakov and Gregory Kucherov",

year = "1997",

doi = "10.1007/bfb0029978",

language = "English",

isbn = "3540634371",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "347--357",

editor = "Igor Privara and Peter Ruzicka",

booktitle = "Mathematical Foundations of Computer Science 1997 - 22nd International Symposium, MFCS 1997, Proceedings",

note = "22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997 ; Conference date: 25-08-1997 Through 29-08-1997",

}