Avoiding patterns in the abelian sense

Canadian Journal of Mathematics

Volumn 53, Issue 4, 2001, Pages 696-714

  Currie, J ^a   Linek, V ^a  

^a UNIVERSITY OF WINNIPEG   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035602469     PISSN: 0008414X     EISSN: None     Source Type: Journal    
DOI: 10.4153/CJM-2001-028-4     Document Type: Article

References (28)

1. Kirby A. Baker, George F. McNulty and Walter Taylor, Growth problems for avoidable words. Theoret. Comput. Sci. (3) 69(1989), 319-345. MR 91f:68109.
2. Kirby A. Baker, George F. McNulty and Walter Taylor, Growth problems for avoidable words. Theoret. Comput. Sci. (3) 69(1989), 319-345. MR 91f:68109.
3. Dwight R. Bean, Andrzej Ehrenfeucht and George McNulty, Avoidable Patterns in Strings of Symbols. Pacific J. Math. 85(1979), 261-294; MR 81i:20075.
4. Dwight R. Bean, Andrzej Ehrenfeucht and George McNulty, Avoidable Patterns in Strings of Symbols. Pacific J. Math. 85(1979), 261-294; MR 81i:20075.
5. Jean Berstel, Axel Thue's papers on repetitions in words: a translation.
6. ∞ the lattice of equational classes of semigroups. Algebra Universalis 1(1971/72), 248-253. MR 45 #5257.
7. ∞ the lattice of equational classes of semigroups. Algebra Universalis 1(1971/72), 248-253. MR 45 #5257.
8. Arturo Carpi, On abelian squares and substitutions. Theoret. Comput. Sci. (1) 218(1999), 61-81.
9. Julien Cassaigne, Motifs évitables et régularités dans les mots. Thèse de doctorat, L.I.T.P., Université Paris 6, 1994.
10. J. Cassaigne and J. Currie, Words strongly avoiding fractional powers. European J. Combin., to appear.
11. James D. Currie, Open problems in pattern avoidance. Amer. Math. Monthly 100(1993), 790-793.
12. F. M. Dekking, Strongly non-repetitive sequences and progression-free sets. J. Combin Theory Ser. A 27(1979), 181-185. MR 81b:05027.
13. F. M. Dekking, Strongly non-repetitive sequences and progression-free sets. J. Combin Theory Ser. A 27(1979), 181-185. MR 81b:05027.
14. Paul Erdös, Some unsolved problems. Magyar Tud. Akad. Mat. Kutato. Int. Kozl. 6(1961), 221-254.
15. A. A. Evdomikov, Strongly asymmetric sequences generated by a finite number of symbols. Dokl. Akad. Nauk. SSSR 179(1968), 1268-1271; Soviet Math. Dokl. 9(1968), 536-539.
16. A. A. Evdomikov, Strongly asymmetric sequences generated by a finite number of symbols. Dokl. Akad. Nauk. SSSR 179(1968), 1268-1271; Soviet Math. Dokl. 9(1968), 536-539.
17. Veikko Keränen, Abelian squares are avoidable on 4 letters. In: Automata, Languages and Programming, Lecture Notes in Comput. Sci. 623, Springer-Verlag, 1992, 41-52.
18. Marston Morse and Gustav A. Hedlund, Symbolic dynamics I, II. Amer. J. Math. 60(1938), 815-866; 62(1940), 1-42. MR 1, 123d.
19. Marston Morse and Gustav A. Hedlund, Symbolic dynamics I, II. Amer. J. Math. 60(1938), 815-866; 62(1940), 1-42. MR 1, 123d.
20. Marston Morse and Gustav A. Hedlund, Symbolic dynamics I, II. Amer. J. Math. 60(1938), 815-866; 62(1940), 1-42. MR 1, 123d.
21. P. S. Novikov and S. I. Adjan, Infinite periodic groups I, II, III. Izv. Akad. Nauk. SSSR Ser. Mat. 32(1968), 212-244; 251-524; 709-731. MR 39 #1532a-c.
22. P. S. Novikov and S. I. Adjan, Infinite periodic groups I, II, III. Izv. Akad. Nauk. SSSR Ser. Mat. 32(1968), 212-244; 251-524; 709-731. MR 39 #1532a-c.
23. P. A. B. Pleasants, Non-repetitive sequences. Proc. Cambridge Philos. Soc. 68(1970), 267-274. MR 42 #85.
24. P. A. B. Pleasants, Non-repetitive sequences. Proc. Cambridge Philos. Soc. 68(1970), 267-274. MR 42 #85.
25. L. N. Shevrin and M. V. Volkov, Identities of semigroups. Math. USSR Izv. (11) 29(1985), 3-47.
26. Axel Thue, Über unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl. Christiana (1906), Nr. 7.
27. A. Zimin, Blocking sets of terms. Mat. Sb. (N.S.) 119 (161)(1982), 363-375, 447; Math. USSR-Sb. 47(1984), 353-364.
28. A. Zimin, Blocking sets of terms. Mat. Sb. (N.S.) 119 (161)(1982), 363-375, 447; Math. USSR-Sb. 47(1984), 353-364.