The minimal density of a letter in an infinite ternary square-free word is 0.2746⋯

Journal of Integer Sequences

Volumn 5, Issue 2, 2002, Pages

  Tarannikov, Yuriy ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Combinatorics on words; Factorial languages; Minimal density; Square free word

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MAPPING; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

INFINITE WORDS; LOWER BOUNDS; MINIMAL DENSITY; TERNARY SQUARE-FREE WORDS;

INTEGER PROGRAMMING;

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

References (9)

1. D. R. Bean, A. Ehrenfeucht, and G. F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math. 85 (1979), 261-294.
2. n/17 n-letter ternary square-free words, J. Integer Sequences 1 (1998), Article 98.1.9.
3. U. Grimm, Improved bounds on the number of ternary square-free words, J. Integer Sequences 4 (2001), Article 01.2.7.
4. R. Kolpakov, G. Kucherov, and Yu. Tarannikov, On repetition-free binary words of minimal density, Theoret. Comput. Sci. 218 (1999), 161-175.
5. A. Restivo, S. Salemi, On weakly square free words, Bulletin of the EATCS, No. 21 (1983), 49-56.
6. L. Rosaz, Unavoidable sets of words, Thèse de doctorat, Université Paris 7, 1993.
7. N. J. A. Sloane, S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995. See also On-line Encyclopedia of Integer Sequences. Available at http://www.research.att.com/~njas/sequences/.
8. N. J. A. Sloane, S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995. See also On-line Encyclopedia of Integer Sequences. Available at http://www.research.att.com/~njas/sequences/.
9. A. Thue, Über unendliche Zeichenreihen, Norske Videnskabers Selskabs Skrifter I, Matematisk-Naturvidenskapelig Klasse, Kristiania, 7 (1906), 1-22.