Combinatorics on words has arisen independently within several branches of mathematics,
for instance, number theory, group theory and probability, and appears frequently in …

The problem of inducing, learning or inferring grammars has been studied for decades, but
only in recent years has grammatical inference emerged as an independent field with …

During the last two decades research on combinatorial problems of words, ie, on
Combinatorics on Words, has grown enormously. Although there has been important …

The two parts of this text are based on two series of lectures delivered by Jean Berstel and
Christophe Reutenauer in March 2007 at the Centre de Recherches Mathematiques …

Terminological variation has been a very important topic in terminology, computational
terminology and natural language processing for twenty years. It was approached in …

The Knuth–Morris–Pratt (KMP) pattern-matching algorithm guarantees both independence
from alphabet size and worst-case execution time linear in the pattern length; on the other …

When a file is to be transmitted from a sender to a recipient and when the latter already has
a file somewhat similar to it, remote differential compression seeks to determine the …

A well-known combinatorial construction, that has many applications in Computer Science
(Françon (1976), Sedgewick and Flajolet (1996), Kundu (1977), Vuillemin (1980)), maps …

In this paper we address the problem of defining a measure of diversity for a population of
individuals whose genome can be subjected to major reorganizations during the …

We give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of
constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use …