arrow
Return

Complement Avoidance in Binary Words

delete2025-10-17
delete0
delete
OA
AI
J
James D. Currie *
Ľ
Ľubomíra Dvořáková
P
Pascal Ochem
D
Daniela Opočenská
N
Narad Rampersad
J
Jeffrey Shallit
DOI:10.37236/11555delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The complement x of a binary word x is obtained by changing each 0 in x to 1 and vice versa. We study infinite binary words w that avoid sufficiently large complementary factors; that is, if x is a factor of w, then x is not a factor of w. In particular, we classify such words according to their critical exponents.
Keywords:
REPETITION
GROWTH

Journal

E
ELECTRONIC JOURNAL OF COMBINATORICS
IF:
0.7
Papers:
173
Citations:
0

Organization

C
centre national de la recherche scientifique (cnrs)
Scholars:
24.5W
Papers: 18.2W
Citations: 279
C
czech technical university prague
Scholars:
6.5K
Papers: 5.3K
Citations: 3
U
universite paul-valery
Scholars:
989
Papers: 730
Citations: 2
U
university of manitoba
Scholars:
2.5K
Papers: 1.1K
Citations: 0
researcher View more organizations