Tero Harju and Dirk Nowotka
Binary Words with Few Squares
Bulletin EATCS, 89:164-166, June 2006.

Abstract

A short proof is given for a result of Fraenkel and Simpson [Electronic J. Combinatorics 2 (1995) #R2] stating that there exists an infinite binary word which has only three different squares u2.

Keywords: combinatorics on words, squares

Full paper: [ps - 190 KB] [ps.gz - 94 KB] [pdf - 108 KB].