How Many Squares Can a String Contain?

Journal of Combinatorial Theory. Series A

Volumn 82, Issue 1, 1998, Pages 112-120

  Fraenkel, Aviezri S ^a   Simpson, Jamie ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b CURTIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006931770     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1997.2843     Document Type: Article

References (8)

1. Crochemore M. An optimal algorithm for computing the repetitions in a word. Inform. Process. Lett. 12:1981;244-250.
2. Crochemore M., Rytter W. Text Algorithms. 1994;Oxford Univ. Press, New York.
3. Crochemore M., Rytter W. Squares, cubes, and time-space efficient string searching. Algorithmica. 13:1995;405-425.
4. Entringer R., Jackson D., Schatz J. On nonrepetitive sequences. J. Combin. Theory. Ser. A. 16:1974;159-164.
5. Fine N. J., Wilf H. S. Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16:1965;109-114.
6. Fraenkel A. S., Simpson R. J. How many squares must a binary sequence contain? Electron. J. Combin. 2:1995.
7. A. S. Fraenkel, R. J. Simpson, The exact number of squares in Fibonacci words.
8. Lothaire M. Combinatorics on Words. 1983;Addison-Wesley, Reading.