Repetition complexity of words

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

Volumn 2387, Issue , 2002, Pages 320-329

  Ilie, Lucian ^a   Yu, Sheng ^a   Zhang, Kaizhong ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Algorithms; De Bruijn words; Infinite words; Iterated morphisms; Lempel Ziv complexity; Repetition complexity; Subword complexity; Ultimate periodicity; Words

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DE BRUIJN; INFINITE WORD; LEMPEL ZIV COMPLEXITY; MORPHISMS; REPETITION COMPLEXITY; SUBWORD COMPLEXITY; ULTIMATE PERIODICITY; WORDS;

COMBINATORIAL MATHEMATICS;

EID: 84949741452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45655-4_35     Document Type: Conference Paper

References (25)

1. Apostolico, A., and Preparata, F., Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci. 22 (1983) 297–315.
2. de Bruijn, N.G., A combinatorial problem, Proc. Kon. Ned. Akad. Wetensch. 49 (1946) 758–764.
3. Chaitin, G.J, Information-theoretic limitations of formal systems, J. Assoc. Comput. Mach. 21 (1974) 403–424.
4. Choffrut, C., and Karhumäki, J., Combinatorics of Words, in: G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, Vol. 1, Springer-Verlag, Berlin, 1997, 329–438.
5. Coven, E.M., and Hedlund, G., Sequences with minimal block growth, Math. Sytems Theory 7 (1973) 138–153.
6. Crochemore, M., An optimal algorithm for computing the repetitions in a word, Inform. Proc. Lett. 12 (5) (1981) 244–250.
7. Crochemore, M., and Rytter, W., Text Algorithms, Oxford Univ. Press, 1994.
8. Crochemore, M., and Rytter, W., Squares, cubes, and time-space efficient string matching, Algorithmica 13 (1995) 405–425. Oxford Univ. Press, 1994.
9. Dejean, F., Sur un théorème de Thue, J. Combin. Theor, Ser. A 13 (1972) 90–99.
10. Garey, M.R., Johnson, D.S., Computers and Intractability. A Guide to the Theory of NP-completeness, W.H. Freeman and Co., San Francisco, 1979.
11. Hansel, G., Perrin, D., and Simon, I., Compression and entropy, Proc. Of STACS’92, LNCS 577, Springer-Verlag, 1992, 515–528.
12. Kolmogorov, A.N., Three approaches to the quantitative definition of information, Probl. Inform Transmission 1 (1965) 1–7.
13. Kolpakov, R., and Kucherov, G., Finding maximal repetitions in a word in linear time, Proc. of FOCS’99, 596–604.
14. Lempel, A., and Ziv, J., On the complexity of finite sequences IEEE Trans. Information Theory 22(1) (1976) 75–81.
15. Lothaire, M., Combinatorics on Words, Addison-Wesley, Reading, MA, 1983.
16. Lothaire, M., Algebraic Combinatorics on Words, Cambridge Univ. Press, 2002.
17. Main, M., and Lorentz, R., An O(n lg n) algorithm for finding all repetitions in a string, J. Algorithms 5 (1984) 422–432.
18. Main, M., Detecting leftmost maximal periodicities, Discrete Appl. Math. 25 (1989) 145–53.
19. Martin-Löf, P., The definition of random sequences, Inform. and Control 9 (1966) 602–619.
20. Morse, M., and Hedlund, G., Unending chess, symbolic dynamics and a problem in semigroups, Duke Math. J. 11 (1944) 1–7.
21. Storer, J.A., Szymanski, T.G., The macro model for data compression, Proc. of 10th STOC, 1978, 30–39.
22. Thue, A., Uber unendliche Zeichenreihen, Norske Vid. Selsk. Skr. Mat.-Nat. Kl. (Kristiania) 7 (1906) 1–22.
23. Thue, A., Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. Mat.-Nat. Kl. (Kristiania) 5 (1912) 1–67.
24. Ziv, J., and Lempel, A., A universal algorithm for sequential data compression, IEEE Trans. Information Theory 23 (3) (1977) 337–343.
25. Ziv, J., and Lempel, A., Compression of individual sequences via variable length encoding, IEEE Trans. Information Theory 24 (5) (1978) 530–536.