2 problems

Let a binary word be an infinite word over the alphabet $\{0,1\}$. A square is a nonempty word of the form $xx$, and a word is cubefree if it contains no nonempty factor of the for…

Four-avoidability conjecture for shuffle squares. Shuffle squares are $4$-avoidable.