Logo image
Se connecter
Complement Avoidance in Binary Words
Document de travail   Open Access

Complement Avoidance in Binary Words

James Currie, Pascal Ochem, Narad Rampersad et Jeffrey Shallit

Résumé

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

Fichiers et liens (1)

url
Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Logo image