Improved bounds on the number of ternary square-free words

Journal of Integer Sequences

Volumn 4, Issue 2, 2001, Pages

  Grimm, Uwe ^a  

^a OPEN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; CONVERGENCE OF NUMERICAL METHODS; ESTIMATION; INTEGER PROGRAMMING; PROBLEM SOLVING; SET THEORY;

BRINKHUIS TRIPLES; INTEGER SEQUENCES; TERNARY WORDS;

NUMBER THEORY;

EID: 2942702448     PISSN: 15307638     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. M. Baake, V. Elser and U. Grimm, The entropy of square-free words, Mathl. Comput. Modelling 26 (1997) 13-26; math-ph/9809010.
2. D. R. Bean, A. Ehrenfeucht and G.F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math. 85 (1979) 261-294.
3. th power-free homomorphisms, Theor. Comp. Sci. 23 (1983) 69-82.
4. J. Brinkhuis, Non-repetitive sequences on three symbols, Quart. J. Math. Oxford 34 (1983) 145-149.
5. M. Crochemore, Sharp characterizations of squarefree morphisms, Theor. Comp. Sci. 18 (1982) 221-226.
6. M. Crochemore, Tests sur les morphismes faiblement sans carré, in: Combinatorics on Words, edited by L. J. Cummings, Academic Press, Toronto (1983), 63-89.
7. n/17 n-letter ternary square-free words. Journal of Integer Sequences 1 (1998) 98.1.9; math.CO/9809135.
8. V. Elser, Repeat-free sequences, Lawrence Berkeley Laboratory report LBL-16632 (1983).
9. S. Finch, Pattern-free word constants, MathSoft Constants web site, URL: http://www.mathsoft.com/asolve/constant/words/words.html.
10. Y. Kobayashi, Repetition-free words, Theor. Comp. Sci. 44 (1986) 175-197.
11. M. Leconte, k-th power-free codes, in: Automata on Infinite Words, edited by M. Nivat and D. Perrin, Automata on Infinite Words, Lecture Notes in Computer Science 192, Springer, Berlin (1985), 172-187.
12. M. Lothaire, Combinatorics on Words, Cambridge University Press, 1983.
13. P. A. B. Pleasants, Nonrepetitive sequences, Proc. Cambr. Philos. Soc. 68 (1970) 267-274.
14. P. Séébold, Overlap-free sequences, in: Automata on Infinite Words, edited by M. Nivat and D. Perrin, Lecture Notes in Computer Science 192, Springer, Berlin (1985), 207-215.
15. R. O. Shelton, On the structure and extendability of square-free words, in: Combinatorics on Words, edited by L. J. Cummings, Academic Press, Toronto (1983), 101-118.
16. N. J. A. Sloane, On-Line Encyclopedia of Integer Sequences, published electronically at: http://www.research.att.com/~/njas/sequences/.
17. S. Wolfram, Mathematica book (4th edition), Cambridge University Press, Cambridge (1999).
18. D. Zeilberger, URL: http://www.math.temple.edu/~zeilberg/mamarim/ mamarimhtml/jan.html.