Circular words avoiding patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2450, Issue , 2003, Pages 319-325

  Currie, James D ^a   Fitzpatrick, D Sean ^a  

^a UNIVERSITY OF WINNIPEG   (Canada)

Author keywords

Combinatorics on words; Thue Morse word; Words avoiding patterns

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CIRCULAR WORDS; COMBINATORICS ON WORDS; GENERAL PATTERNS; THUE-MORSE WORD; WORDS AVOIDING PATTERNS;

ARTIFICIAL INTELLIGENCE;

EID: 33846217586     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45005-x_28     Document Type: Conference Paper

References (10)

1. Kirby A. Baker, George F. McNulty & Walter Taylor, Growth problems for avoidable words, Theoret. Comput. Sci. 69 (1989), no. 3, 319–345; MR 91f:68109.
2. Dwight R. Bean, Andrzej Ehrenfeucht & George McNulty, Avoidable Patterns in Strings of Symbols, Pacific J. Math. 85 (1979), 261–294.
3. James D. Currie, There are ternary circular square-free words of length n for n ≥ 18, Elec. J. Comb. 9(1) N10.
4. Francoise Dejean, Sur un théorème de Thue, J. Combin. Theory Ser. A 13 (1972), 90–99.
5. Paul Erdös, Some unsolved problems, Magyar Tud. Akad. Mat. Kutato. Int. Kozl. 6 (1961), 221–254.
6. Earl D. Fife, Binary sequences which contain no BBb, Trans. Amer. Math. Soc. 261 (1980), 115–136; MR 82a:05034
7. Vaclav Linek, Personal communication.
8. Marston Morse & Gustav A. Hedlund, Symbolic dynamics I, II, Amer. J. Math. 60 (1938), 815–866; 62 (1940), 1–42; MR 1, 123d.
9. Axel Thue, über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana (1912), 1–67.
10. A. Zimin, Blocking sets of terms, Mat. Sb. (N.S.) 119 (161) (1982); Math. USSR Sbornik 47 (1984), 353–364.