We give a systematical treatment of repetition-free words and repetition-free homomorphisms. We study the global structure of the set of repetition-free ...

Introduction. Using two letters a and b we cannot make an arbitrarily long word not containing a square. In fact, aba and bab are the longest such words.

Jun 24, 2023 · A bordered box repetition-free word is a finite word w where any given factor of the form axa, with and , occurs at most once.

A bordered box repetition-free word is a finite word w where any given factor of the form asa, with a ∈ Σ and s ∈ Σ∗, occurs at most once.

This review reports results on the growth of the number of -free words of length n over an q-letter alphabet. In some cases, growth is bounded by a polynomial ...

Feb 28, 2023 · Four existing search algorithms are adapted to search for long bordered box repetition-free words over a given alphabet, giving an empirical ...

A well-known problem is studied of the number of repetition-free words of the two types: the square-free words over a three-letter alphabet and the cube-free ...

There are circular square-free words of length $n$ on three symbols for $n\ge 18$. This proves a conjecture of R. J. Simpson.

A well-known problem is studied of the number of repetition-free words of the two types: the square-free words over a three-letter alphabet and the cube-fr.

Repetition-free words over finite alphabets are a traditional object of research in combi- natorics of words. A word w over an alphabet Σ is a finite ...