Complement Avoidance in Binary Words

09/20/2022
by   James Currie, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2022

Antisquares and Critical Exponents

The complement x̅ of a binary word x is obtained by changing each 0 in x...
research
03/06/2022

Intertwining of Complementary Thue-Morse Factors

We consider the positions of occurrences of a factor x and its binary co...
research
09/05/2018

Repetition avoidance in products of factors

We consider a variation on a classical avoidance problem from combinator...
research
04/19/2019

New results on pseudosquare avoidance

We start by considering binary words containing the minimum possible num...
research
11/26/2019

Words Avoiding Reversed Factors, Revisited

In 2005, Rampersad and the second author proved a number of theorems abo...
research
01/15/2023

Dyck Words, Pattern Avoidance, and Automatic Sequences

We study various aspects of Dyck words appearing in binary sequences, wh...
research
06/07/2022

Fibonacci-like sequences for variants of the tower of Hanoi, and corresponding graphs and gray codes

We modify the rules of the classical Tower of Hanoi puzzle in a quite na...

Please sign up or login with your details

Forgot password? Click here to reset