Word complexity and repetitions in words

International Journal of Foundations of Computer Science

Volumn 15, Issue 1, 2004, Pages 41-55

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

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

de Bruijn words; iterated morphisms; Lempel Ziv complexity; repetitions in words; subword complexity

Indexed keywords

EID: 33750090137     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054104002297     Document Type: Conference Paper

References (25)

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