Complement Avoidance in Binary Words

The complement $\bar{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. We study infinite binary words $\mathbf{w}$ that avoid sufficiently large complementary factors; that is, if $x$ is a factor of $\mathbf{w}$ then $\bar{x}$ is not a factor of $\mathbf{w}$. In particular, we classify such words according to their critical exponents.