Polynomial versus exponential growth in repetition-free binary words

Journal of Combinatorial Theory. Series A

Volumn 105, Issue 2, 2004, Pages 335-347

  Karhumäki, Juhani ^a   Shallit, Jeffrey ^b  

^a UNIVERSITY OF TURKU   (Finland)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Cubefree; Exponential growth; Fractional power; Polynomial growth; Repetition free

Indexed keywords

EID: 11144354707     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcta.2003.12.004     Document Type: Article

References (24)

1. J.-P. Allouche, J. Shallit, Automatic Sequences: Theory, Applications, Generalizations, Cambridge University Press, Cambridge, 2003.
2. F.-J. Brandenburg, Uniformly growing k-th power-free homomorphisms, Theoret. Comput. Sci. 23 (1983) 69-82.
3. A. Carpi, Overlap-free words and finite automata, Theoret. Comput. Sci. 115 (1993) 243-260.
4. J. Cassaigne, Counting overlap-free binary words, in: P. Enjalbert, A. Finkel, K.W. Wagner (Eds.), STACS 93, Proceedings of the 10th Symposium Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 665, Springer, Berlin, 1993, pp. 216-225.
5. F. Dejean, Sur un théorème de Thue, J. Combin. Theory. Ser. A 13 (1972) 90-99.
6. F.M. Dekking, On repetitions of blocks in binary sequences, J. Combin. Theory. Ser. A 20 (1976) 292-299.
7. A.E. Edlin, The number of binary cube-free words of length up to 47 and their numerical analysis, J. Differential Equations Appl. 5 (1999) 353-354.
8. U. Grimm, Counting power-free words in two letters, Poster Presentation at Oberwohlfach Meeting on Aperiodic Order, May, 2001.
9. T. Harju, J. Karhumäki, Morphisms, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer, Berlin, 1997, pp. 439-510.
10. A.-J. Kfoury, A linear-time algorithm to decide whether a binary word contains an overlap, RAIRO Inform. Théory Appl. 22 (1988) 135-145.
11. Y. Kobayashi, Repetition-free words, Theoret. Comput. Sci. 44 (1986) 175-197.
12. Y. Kobayashi, Enumeration of irreducible binary words, Discrete Appl. Math. 20 (1988) 221-232.
13. R. Kolpakov, G. Kucherov, Minimal letter frequency in n-th power-free binary words, in: I. Prívara, P. Ružička (Eds.), Proceedings of the 22nd Symposium, Mathematical Foundations of Computer Science 1997, Lecture Notes in Computer Science, Vol. 1295, Springer, Berlin, 1997, pp. 347-357.
14. R. Kolpakov, G. Kucherov, Y. Tarannikov, On repetition-free binary words of minimal density, Theoret. Comput. Sci. 218 (1999) 161-175.
15. +-free words over a binary alphabet, Master's Thesis, University of Turku, Finland, 1995.
16. M. Lothaire, Combinatorics on Words, in: Encyclopedia of Mathematics and its Applications, Vol. 17, Addison-Wesley, Reading, MA, 1983.
17. M. Lothaire, Algebraic Combinatorics on Words, in: Encyclopedia of Mathematics and its Applications, Vol. 90, Cambridge University Press, Cambridge, 2002.
18. J. Noonan, D. Zeilberger, The Goulden-Jackson cluster method: extensions, applications and implementations, J. Differential Equations Appl. 5 (1999) 355-377.
19. A. Restivo, S. Salemi, On weakly square free words, Bull. European Assoc. Theoret. Comput. Sci. No. 21 (1983) 49-56.
20. A. Restivo, S. Salemi, Overlap free words on two symbols, in: M. Nivat, D. Perrin (Eds.), Automata on Infinite Words, Lecture Notes in Computer Science, Vol. 192, Springer, Berlin, 1985, pp. 198-206.
21. J. Shallit, Simultaneous avoidance of large squares and fractional powers in infinite binary words, Internat. J. Found. Comput. Sci., to appear, preprint, available at http://www.arxiv.org/abs/math.CO/0304476, 2003.
22. A.M. Shur, The structure of the set of cube-free Z-words in a two-letter alphabet, Izv. Ross. Akad. Nauk Ser. Mat. 64 (4) (2000) 201-224 (in Russian) (English trans.: Izv. Math. 64 (2000) 847-871).
23. Y. Tarannikov, The minimal density of a letter in an infinite ternary square-free word is 0.2746⋯. J. Integer Sequences 5 (2002) 02.2.2 (electronic). http://www.math.uwaterloo.ca/JIS/VOL5/Tarannikov/tarann7.html
24. A. Thue, Über unendliche Zeichenreihen, Norske vid. Selsk. Skr. Mat. Nat. Kl. 7 (1906) 1-22 (Reprinted in: T. Nagell (Ed.), Selected Mathematical Papers of Axel Thue, Universitetsforlaget, Oslo, 1977, pp. 139-158).