We propose a new proof technique that aims to be applied to the same problems as the
Lov\'asz Local Lemma or the entropy-compression method. We present this approach in the …

Formal Languages, Automaton and Numeration Systems presents readers with a review of
research related to formal language theory, combinatorics on words or numeration systems …

The interplay between words, computability, algebra and arithmetic has now proved its
relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite …

Internationally recognised researchers look at developing trends in combinatorics with
applications in the study of words and in symbolic dynamics. They explain the important …

Shuffle algebras are monoids for an unconventional monoidal category structure on graded
vector spaces. We present two homological results on shuffle algebras with monomial …

We prove game‐theoretic versions of several classical results on nonrepetitive sequences,
showing the existence of winning strategies using an extension of the Lovász Local Lemma …

In combinatorics on words, a word $ w $ over an alphabet $\Sigma $ is said to avoid a
pattern $ p $ over an alphabet $\Delta $ if there is no factor $ f $ of $ w $ such that $ f= h (p) …

In combinatorics on words, a word $ w $ over an alphabet $\Sigma $ is said to avoid a
pattern $ p $ over an alphabet $\Delta $ if there is no factor $ f $ of $ w $ such that $ f=(p) …

The growth properties of power-free languages over finite alphabets are studied. A method
to obtain sharp two-sided bounds of the growth rate of β-power-free languages for arbitrary …

Cassaigne conjectured in 1994 that any pattern with m distinct variables of length at least 3
(2 m− 1) is avoidable over a binary alphabet, and any pattern with m distinct variables of …