2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/226688We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.6 pagesCombinatoricsFormal Languages and Automata Theory68R15text