String matching is one of the oldest algorithmic techniques, yet still one of the most
pervasive in computer science. The past 20 years have seen technological leaps in …

This collaborative volume aims at presenting and developing recent trends at the interface
between the study of sequences, groups, and number theory, as the title may suggest. It is …

The exponent of a word is the ratio of its length over its smallest period. The repetitive
threshold r (a) of an a-letter alphabet is the smallest rational number for which there exists …

We start by considering binary words containing the minimum possible numbers of squares
and antisquares (where an antisquare is a word of the form xx xx¯), and we completely …

We investigate the finite repetition threshold for k-letter alphabets, k≥ 4, that is the smallest
number r for which there exists an infinite r+-free word containing a finite number of r …

A square is the concatenation of a nonempty word with itself. A word has period p if its letters
at distance p match. The exponent of a nonempty word is the quotient of its length over its …

We re-examine previous constructions of infinite binary words containing few distinct
squares with the goal of finding the “simplest”, in a certain sense. We exhibit several new …

It is commonly admitted that the origin of combinatorics on words goes back to the work of
Axel Thue in the beginning of the twentieth century, with his results on repetition-free words …

A square in a word is composed of two adjacent occurrences of a nonempty word. This note
gives a simple proof and a straight construction of the existence of an infinite binary word …

I kombinatoriske og inkludert kombinasjonsord gjelder setningen Dejean, kalt formodning
Dejean før vist, gjentakelser fraksjonell eksponent i uendelige ord. Antagelsen ble formulert i …