Square-free word

A square-free word is a string of characters (often taken from a finite alphabet) that does not contain any substring of the form \( xx \), where \( x \) is a non-empty string. In other words, a square-free word does not have any consecutive repetitions of substrings. For example, the string "abac" is square-free because there are no such repetitions.