Complement avoidance in binary words

DOI10.37236/11555MaRDI QIDQ6901238zbMATH OpenFDO

Authors James D. Currie, L'ubomíra Dvořáková, Pascal Ochem, Daniela Opočenská, Narad Rampersad, Jeffrey Shallit

Publication date 12 November 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/11555

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• A generalization of repetition threshold
• A proof of Dejean’s conjecture
• Antisquares and critical exponents
• Bounds for the generalized repetition threshold
• Complementary symmetric Rote sequences: the critical exponent and the recurrence function
• Critical exponent of binary words with few distinct palindromes
• Critical exponents of infinite balanced words
• De Bruijn sequences for the binary strings with maximum density
• Extremal overlap-free and extremal -free binary words
• Finite-repetition threshold for infinite ternary words
• Growth properties of power-free languages
• scientific article; zbMATH DE number 3947643 (Why is no real title available?)
• Last cases of Dejean's conjecture
• On Abelian repetition threshold
• On balanced sequences and their critical exponent
• On minimal critical exponent of balanced sequences
• Polynomial versus exponential growth in repetition-free binary words
• Properties of a ternary infinite word
• Repetition avoidance in circular factors
• SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
• Special factors, periodicity, and an application to Sturmian words
• Sur un théorème de Thue
• The repetition threshold for binary rich words

Cited in

(1)

• More characterizations of morphic words

This page was built for publication: Complement avoidance in binary words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6901238)