Square-free word

In combinatorics, a squarefree word is a word (a sequence of symbols) that does not contain any squares. A square is a word of the form $XX$ , where $X$ is not empty. Thus, a squarefree word can also be defined as a word that avoids the pattern $XX$ .

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.