Growth of repetition-free words—a review
Author:
- 1 June 2005
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 340 (2) , 280-290
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Polynomial versus exponential growth in repetition-free binary wordsJournal of Combinatorial Theory, Series A, 2004
- Motif statisticsTheoretical Computer Science, 2002
- The Goulden—Jackson cluster method: extensions, applications and implementationsJournal of Difference Equations and Applications, 1999
- The number of binary cube-free words of length up to 47 and their numerical analysisJournal of Difference Equations and Applications, 1999
- On the number of Abelian square-free words on four lettersDiscrete Applied Mathematics, 1998
- Enumeration of irreducible binary wordsDiscrete Applied Mathematics, 1988
- Uniformly growing k-th power-free homomorphismsTheoretical Computer Science, 1988
- Sequences generated by infinitely iterated morphismsDiscrete Applied Mathematics, 1985
- A propos d'une conjecture de F. Dejean sur les répétitions dans les motsDiscrete Applied Mathematics, 1984
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLSThe Quarterly Journal of Mathematics, 1983