Pattern avoidance: Themes and variations

Theoretical Computer Science

Volumn 339, Issue 1, 2005, Pages 7-18

  Currie, James D ^a  

^a UNIVERSITY OF WINNIPEG   (Canada)

Author keywords

Combinatorics on words; Words avoiding patterns

Indexed keywords

ALGEBRA; INTEGER PROGRAMMING; MATHEMATICAL MODELS; THEOREM PROVING;

ABELIAN POWERS; COMBINATORICS WORDS; SYMBOLIC DYNAMICS; WORDS AVOIDING PATTERNS;

PROBLEM SOLVING;

EID: 18644366449     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.01.004     Document Type: Conference Paper

References (70)

1. S. Adjan, P.S. Novikov, Infinite periodic groups I-III, Izv. Akad. Nauk SSSR Ser. Mat. 32 (1968) (in Russian).
2. N. Alon, J. Grytczuk, M. Haluszczak, and O. Riordan Nonrepetitive colorings of graphs Random Structures and Algorithms 21 3-4 2002 336 346
3. N. Alon, and J.H. Spencer The Probabilistic Method 2nd ed. 2000 Wiley New York
4. S.V. Avgustinovich, and A.E. Frid Words avoiding abelian inclusions J. Automat. Lang. Comb. 7 1 2002 3 9
5. M. Baake, V. Elaser, and U. Grimm The entropy of square-free words Math. Comput. Modelling 26 1997 13 26
6. K.A. Baker, G.F. McNulty, and W. Taylor Growth problems for avoidable words Theoret. Comput. Sci. 69 3 1989 319 345; MR 91f:68109.
7. D.R. Bean, A. Ehrenfeucht, and G. McNulty Avoidable patterns in strings of symbols Pacific J. Math. 85 1979 261 294; MR 81i:20075.
8. J. Beck, An application of Lovász local lemma: there exists an infinite 01-sequence containing no near identical intervals, Finite and Infinite Sets, Vols. I, II, Eger, 1981
9. Colloquia. Mathematica Societatis János Bolyai, Vol. 37, North-Holland, Amsterdam, 1984, pp. 103-107.
10. J. Berstel, Axel Thue's papers on repetitions in words: a translation, Publications du LCIM, Vol. 20, Université du Quebec à Montréal, 1994.
11. F.J. Brandenburg Uniformly growing k-th powerfree homomorphisms Theoret. Comput. Sci. 23 1983 69 82
12. J. Brinkhuis Non-repetitive sequences on three symbols Quart. J. Math. Oxford Ser. 34 2 1983 145 149
13. A. Carpi Multidimensional unrepetitive configurations Theoret. Comput. Sci. 56 2 1988 233 241
14. A. Carpi Overlap-free words and finite automata Theoret. Comput. Sci. 115 2 1993 243 260
15. A. Carpi On representation systems Internat. J. Algebra Comput. 4 4 1994 657 690
16. A. Carpi On the number of Abelian square-free words on four letters Discrete Appl. Math. 81 1998 155 167
17. A. Carpi On abelian squares and substitutions Theoret. Comput. Sci. 218 1 1999 61 81
18. A. Carpi On Abelian squares and substitutions Theoret. Comput. Sci. 218 1999 61 81
19. J. Cassaigne, Counting Overlap-free Binary Words, Lecture Notes in Computer Science, Vol. 665, Springer, Berlin, 1993, pp. 216-225.
20. J. Cassaigne, Motifs évitables et régularités dans les mots, Thèse de doctorat, L.I.T.P., Université Paris, 6, 1994.
21. J. Cassaigne, An algorithm to test if a given circular HD0L-language avoids a pattern. Information Processing '94, Vol. I Hamburg, 1994
22. IFIP Transactions American Computer Science Technology, Vol. A-51, North-Holland, Amsterdam, 1994, pp. 459-464.
23. J. Cassaigne, and J.D. Currie Words strongly avoiding fractional powers European J. Combin. 20 8 1999 725 737
24. R.J. Clark, Avoidable formulas in combinatorics on words, Doctoral Thesis, UCLA, 2001.
25. R. Cori, M.R. Formisano, On the number of partially abelian square-free words on a three-letter alphabet, Theoret. Comput. Sci. 81 (1) (1991) (Part A) 147-153.
26. M. Crochemore Sharp characterizations of squarefree morphisms Theoret. Comput. Sci. 18 2 1982 221 226
27. J.D. Currie, There are ternary circular square-free words of length n for n ≥ 18, Elec. J. Comb. 9(1) (2002) N10.
28. J.D. Currie, D.S. Fitzpatrick, Circular words avoiding patterns, in: M. Ito, M. Toyama (Eds.), Developments in Language Theory, Sixth Internat. Conf., DLT 2002, Kyoto, Japan, Lecture Notes in Computer Science, to appear, Springer, Berlin, 2003.
29. J.D. Currie, and V. Linek Avoiding patterns in the Abelian sense Canadian J. Math. 51 4 2001 696 714
30. J.D. Currie, and R.O. Shelton Cantor sets and Dejean's conjecture J. Automat. Lang. Comb. 1 2 1996 113 127
31. J.D. Currie, R.J. Simpson, Non-repetitive tilings, Electron. J. Combin. 9 (1) (2002) Research Paper 28.
32. F. Dejean Sur un théorème de Thue J. Combin. Theory Ser. A 13 1972 90 99
33. F.M. Dekking Strongly non-repetitive sequences and progression-free sets J. Combin. Theory Ser. A 27 1979 181 185
34. S.B. Ekhad, and D. Zeilberger There are more than 2 (n / 17) n-letter ternary square-free words J. Integer Seq. 1 1998 98.1.9
35. P. Erdös Some unsolved problems Magyar Tud. Akad. Mat. Kutato. Int. Kozl. 6 1961 221 254
36. A.A. Evdomikov Strongly asymmetric sequences generated by a finite number of symbols Dokl. Akad. Nauk. SSSR 179 1968 1268 1271
37. Soviet Math. Dokl. 9 (1968) 536-539.
38. D.S. Fitzpatrick, The Thue-Morse word contains circular overlap-free words of every length, 2003, preprint.
39. U. Grimm Improved bounds on the number of ternary square-free words J. Integer Seq. 4 2001
40. J. Grytczuk, Thue-like sequences and rainbow arithmetic progressions, Electron. J. Combin. 9 (1) (2002) Research Paper 44, 10 pp.
41. J. Grytczuk Pattern avoiding colorings of Euclidean spaces Ars Combin. 64 2002 109 116
42. S. Istrail On irreductible languages and nonrational numbers Bull. Math. Soc. Sci. Math. R. S. Roumanie, Tome 2169, nr. 3-4 1977 301 308
43. J. Jezek Intervals in the lattice of varieties Algebra Universalis 6 1976 147 158
44. J. Justin Characterization of the repetitive commutative semigroups J. Algebra 21 1972 87 90
45. J. Karhumäki On cube-free ω -words generated by binary morphisms Discrete Appl. Math. 5 3 1983 279 297
46. J. Karhumaki, and J. Shallit Polynomial versus exponential growth in repetition-free binary words J. Combin. Theory Ser. A 105 2004 335 347
47. V. Keränen, Abelian squares are avoidable on 4 letters, Automata, Languages and Programming: Lecture Notes in Computer Science, Vol. 623, Springer, Berlin, 1992, pp. 41-52.
48. A.J. Kfoury A linear-time algorithm to decide whether a binary word contains an overlap RAIRO Inform. Théor. Appl. 22 2 1988 135 145
49. O. Kharlampovich, and M. Sapir Algorithmic problems in varieties, a survey Internat. J. Algebra Comput. 12 1995 379 602
50. Y. Kobayashi Enumeration of irreducible binary words Discrete Appl. Math. 20 3 1988 221 232
51. R. Kolpakov, G. Kucherov, Minimal letter frequency in n th power-free binary words, Mathematical Foundations of Computer Science, Bratislava, 1997, Lecture Notes in Computer Science, Vol. 1295, Springer, Berlin, 1997, pp. 347-357.
52. R. Kolpakov, G. Kucherov, and Y. Tarannikov On repetition-free binary words of minimal density Theoret. Comput. Sci. 218 1 1999 161 175
53. A. Lindenmeyer Mathematical model for cellular interaction in development. Parts I and II J. Theoret. Biol. 18 1968 280 315
54. J. Loftus, J. Shallit, M.-W. Wang, New problems of pattern avoidance, Developments In Language Theory 1999, Aachen, World Sci. Publishing, River Edge, NJ, 2000, pp. 185-199.
55. A. Luca, and S. Varriccio Some combinatorial properties of the Thue-Morse sequence and a problem of semigroups Theoret. Comput. Sci. 63 1989 333 348
56. M.G. Main, W. Bucher, and D. Haussler Applications of an infinite squarefree CO-CFL Inform Process Lett. 20 1985 105 107
57. M. Morse Recurrent geodesics on a surface of negative curvature Trans. Amer. Math. Soc. 22 1921 84 100
58. J. Noonan, and D. Zeilberger The Goulden-Jackson cluster method extensions, applications, and implementations J. Difference Eq. Appl. 5 1999 355 377
59. J.M. Ollagnier Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10, and 11 letters Theoret. Comput. Sci. 95 1992 187 205
60. J.-J. Pansiot A propos d'une conjecture de F. Dejean sur les répétitions dans les mots Discrete Appl. Math. 7 1984 297 311
61. P.A.B. Pleasants Non-repetitive sequences Proc. Cambridge Philos. Soc. 68 1970 267 274
62. R.O. Shelton, On the structure and extendibility of square-free words, Combinatorics on Words: Progress and Perspectives, Academic Press, New York, 1983, pp. 101-188.
63. R.O. Shelton (I, II, III), R.P. Soni (II, III), Aperiodic words on three symbols I, II, III, J. Reine Agnew. Math. 321, 327, 330 (1981) 195-209,1-11,44-52; MR 82m:05004a-c.
64. Y. Tarannikov, The minimal density of a letter in an infinite ternary square-free word is 0.2746 ⋯, J. Integer Seq. 5 (2) (2002) Article 02.2.2.
65. A. Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana 7 (1906).
66. A. Thue, Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana 10 (1912).
67. W.T. Trotter, and P. Winkler Arithmetic progressions in partially ordered sets ORDER 4 1987 37 42
68. Xinyu Sun, New lower-bound on the number of ternary square-free words, preprint, http://euclid.math.temple.edu/~xysun/ternarysf/ternary_square_free.htm
69. A. Zimin Blocking sets of terms Mat. Sb. N.S. 119 161 1982
70. A. Zimin Blocking sets of terms Math. USSR Sb. 47 1984 353 364