A simple proof that a word of length n has at most 2n distinct squares

Journal of Combinatorial Theory. Series A

Volumn 112, Issue 1, 2005, Pages 163-164

  Ilie, Lucian ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Combinatorics on words; Squares

Indexed keywords

EID: 25144432769     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcta.2005.01.006     Document Type: Article

References (4)

1. M. Crochemore W. Rytter Squares, cubes, and time-space efficient string searching Algorithmica 13 1995 405-425
2. A.S. Fraenkel J. Simpson How many squares can a string contain? J. Combin. Theory, Ser. A 82 1998 112-120
3. M. Lothaire Combinatorics on Words 1983 Addison-Wesley Reading, MA
4. M. Lothaire Algebraic Combinatorics on Words 2002 Cambridge University Press Cambridge