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

摘要

We give a very short proof of a result by Fraenkel and Simpson (J. Combin. Theory, Ser. A 82 (1998) 112) which states that the number of distinct squares in a word of length 17 is at most 2n. (c) 2005 Elsevier Inc. All rights reserved.