Repetitive perhaps, but certainly not boring

Theoretical Computer Science

Volumn 249, Issue 2, 2000, Pages 343-355

  Smyth, W F ^a,b  

^a MCMASTER UNIVERSITY   (Canada)

^b CURTIN UNIVERSITY   (Australia)

Author keywords

Cover; Repeat; Repetition; String; Word

Indexed keywords

EID: 0346008271     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00067-0     Document Type: Article

References (44)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design & Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A. Apostolico, A. Ehrenfeucht, Efficient detection of quasiperiodicities in strings, Theoret. Comput. Sci. 119 (1993) 247-265.
3. A. Apostolico, M. Farach, C.S. Iliopoulos, Optimal superprimitivity testing for strings, Inform. Process. Lett. 39 (1991) 17-20.
4. A. Apostolico, F.P. Preparata, Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci. 22 (1983) 297-315.
5. D.R. Bean, A. Ehrenfeucht, G.F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math. 85 (2) (1979) 261-294.
6. A.M. Ben-Amram, O. Berkman, C.S. Iliopoulos, K. Park, The subtree max gap problem with application to parallel string covering, Inform. and Comput. 123 (1) (1995) 127-137.
7. J. Berstel, P. Séébold, A characterization of Sturmian morphisms, in: A. Borzyszkowski, S. Sokolowski (Eds.), The Mathematical Foundations of Computer Science, Springer, Berlin, 1993, pp. 281-290.
8. D. Breslauer, An on-line string superprimitivity test, Inform. Process. Lett. 44 (1992) 345-347.
9. T.C. Brown, Descriptions of the characteristic sequence of an irrational, Canad. Math. Bull. 36 (1) (1993) 15-21.
10. T. Crawford, C.S. Iliopoulos, R. Raman, String matching techniques for musical similarity & melodic recognition, preprint.
11. M. Crochemore, An optimal algorithm for computing all the repetitions in a word, Inform. Process. Lett. 12 (5) (1981) 244-248.
12. L.J. Cummings, W.F. Smyth, Weak repetitions in strings, J. Combin. Math. & Combin. Comput. 24 (1997) 33-48.
13. J. Currie, Open problems in pattern avoidance, Amer. Math. Monthly 100 (8) (1993) 790-793.
14. B. Dahanayake, Generalized repetitions: a new approach, M.Sc. Thesis, Department of Computer Science and Systems, McMaster University, 1998.
15. F.M. Dekking, Strongly nonrepetitive sequences and progression-free sets, J. Combin. Theory A 27 (1979) 181-185.
16. P. Erdös, Some unsolved problems, Hungarian Academy of Sciences Mat. Kutató Intézet Közl. 6 (1961) 221-254.
17. N.J. Fine, H.S. Wilf, Uniqueness theorems for periodic functions, Proc. Amer. Math. Soc. 16 (1965) 109-114.
18. A.S. Fraenkel, J. Simpson, The exact number of squares in Fibonacci words, Theoret. Comput. Sci. special 'Words' issue (1999) to appear.
19. F. Franěk, A. Karaman, W.F. Smyth, Repetitions in Sturmian strings, Proc. 9th Australasian Workshop on Combinatorial Algorithms, School of Computing, Curtin University, 1998, pp. 107-116.
20. D. Gusfield, Algorithms on Strings, Trees & Sequences, Cambridge University Press, Cambridge, 1997, 534pp.
21. C.S. Iliopoulos, D. Moore, K. Park, Covering a string, Algorithmica 16 (1996) 288-297.
22. C.S. Iliopoulos, D. Moore, W.F. Smyth, A characterization of the squares in a Fibonacci string, Theoret. Comput. Sci. 172 (1997) 281-291.
23. C.S. Iliopoulos, L. Mouchard, Fast local covers, preprint.
24. C.S. Iliopoulos, K. Park, An optimal O(nloglogn)-time algorithm for parallel superprimitivity testing, J. Korea Inform. Sci. Soc. 21 (8) (1994) 1400-1404.
25. C.S. Iliopoulos, W.F. Smyth, On-line algorithms for k-covering, Proc. 9th Australasian Workshop on Combinatorial Algorithms, School of Computing, Curtin University, 1998, pp. 97-106.
26. J. Karhumäki, On cube-free ω-words generated by binary morphisms, Discrete Appl. Math. 5 (1983) 279-297.
27. V. Keränen, Abelian squares are Avoidable on 4 Letters, Lecture Notes in Computer Science, Vol. 623, Springer, Berlin, 1992, pp. 41-52.
28. R. Kolpakov, G. Kucherov, Minimal letter frequency in nth Power-Free Binary Words, Lecture Notes in Computer Science, Vol. 1295, Springer, Berlin, 1997, pp. 347-357.
29. R. Kolpakov, G. Kucherov, Maximal repetitions in words or how to find all squares in linear time, Internal Report No. LORIA 98-R-227, Laboratoire Lorrain de Recherche en Informatique et ses Applications, 1998, 22pp.
30. G.M. Landau, J.P. Schmidt, An algorithm for approximate tandem repeats, Proc. 4th Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 648, Springer, Berlin, 1993, pp. 120-133.
31. Y. Li, W.F. Smyth, An optimal on-line algorithm to compute all the covers of a string, Algorithmica, to appear.
32. A. de Luca, F. Mignosi, Some combinatorial properties of Sturmian words, Theoret. Comput. Sci. 136 (1994) 361-385.
33. M.G. Main, R.J. Lorentz, An O(nlogn) algorithm for finding all repetitions in a string, J. Algorithms 5 (1984) 422-432.
34. F. Mignosi, On the number of factors of Sturmian words, Theoret. Comput. Sci. 82 (1989) 221-242.
35. D. Moore, W.F. Smyth, An optimal algorithm to compute all the covers of a string, Inform. Process. Lett. 50 (5) (1994) 239-246.
36. D. Moore, W.F. Smyth, A correction to "An optimal algorithm to compute all the covers of a string", Inform. Process. Lett. 54 (1995) 101-103.
37. P.A.B. Pleasants, Non-repetitive sequences, Proc. Cambridge Phil. Soc. 68 (1970) 267-274.
38. G. Rauzy, Mots infinis en arithmétique, in: M. Nivat, D. Perrin (Eds.), Automata on Infinite Words, Lecture Notes in Computer Science, Vol. 192, Springer, Berlin, 1984, pp. 165-171.
39. J.P. Schmidt, All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings, SIAM J. Comput. 27-4 (1998) 972-992.
40. J. Shallit, Characteristic words as fixed points of homomorphisms, preprint.
41. J.S. Sim, C.S. Iliopoulos, K. Park, W.F. Smyth, Approximate periods of strings, Proc. Tenth Symp. on Combinatorial Pattern Matching Lecture Notes in Computer Science 1645, Springer, Berlin, 1999, pp. 123-133.
42. K.B. Stolarsky, Beatty sequences, continued fractions, and certain shift operators, Canad. Math. Bull. 19 (4) (1976) 473-482.
43. J. Stoye, D. Gusfield, Simple and flexible detection of contiguous repeats using a suffix tree, preprint.
44. A. Thue, Über unendliche zeichenreihen, Norske, Vid. Selsk. Skr. I, Mat. Nat. K1. Christiana 7 (1906) 1-22.