Polynomial versus exponential growth in repetition-free binary words
Authors:
- Juhani KarhumäkiJKJuhani Karhumäki
- Jeffrey ShallitJSJeffrey Shallit
- 1 February 2004
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 105 (2) , 335-347
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- On repetition-free binary words of minimal densityTheoretical Computer Science, 1999
- 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
- Overlap-free words and finite automataTheoretical Computer Science, 1993
- Enumeration of irreducible binary wordsDiscrete Applied Mathematics, 1988
- Uniformly growing k-th power-free homomorphismsTheoretical Computer Science, 1988
- A linear-time algorithm to decide whether a binary word contains an overlapRAIRO - Theoretical Informatics and Applications, 1988
- Repetition-free wordsTheoretical Computer Science, 1986
- On repetitions of blocks in binary sequencesJournal of Combinatorial Theory, Series A, 1976
- Sur un théorème de ThueJournal of Combinatorial Theory, Series A, 1972