Letter frequency in infinite repetition-free words
Author:
- 1 June 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 380 (3) , 388-392
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Dejean’s conjecture and Sturmian wordsEuropean Journal of Combinatorics, 2007
- On the Repetition Threshold for Large AlphabetsLecture Notes in Computer Science, 2006
- A generalization of repetition thresholdTheoretical Computer Science, 2005
- Polynomial versus exponential growth in repetition-free binary wordsJournal of Combinatorial Theory, Series A, 2004
- mreps: efficient and flexible detection of tandem repeats in DNANucleic Acids Research, 2003
- How Many Square Occurrences Must a Binary Sequence Contain?The Electronic Journal of Combinatorics, 2003
- On repetition-free binary words of minimal densityTheoretical Computer Science, 1999
- Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 lettersTheoretical Computer Science, 1992
- Sharp characterizations of squarefree morphismsTheoretical Computer Science, 1982
- Sur un théorème de ThueJournal of Combinatorial Theory, Series A, 1972