Logo image
Se connecter
Complement Avoidance in Binary Words
Article de revue   Open Access

Complement Avoidance in Binary Words

James Currie, Lubomíra Dvoraková, Pascal Ochem, Daniela Opočenská, Narad Rampersad et Jeffrey Shallit
The Electronic Journal of Combinatorics, Vol.32(4)
17/10/2025

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 (2)

url
Find in HALAfficher
url
https://doi.org/10.37236/11555Afficher
Published (Version of record) Ouvrir

Indicateurs

1 Consultations de la notice

Détails

Logo image