In 1875, Elwin Bruno Christoffel introduced a special class of words on a binary alphabet
linked to continued fractions which would go onto be known as Christoffel words. Some …

The longest Lyndon substring of a string T is the longest substring of T which is a Lyndon
word. LLS (T) denotes the length of the longest Lyndon substring of a string T. In this paper …

We present an algorithm for computing the Lyndon factorization of a string that is given in
grammar compressed form, namely, a Straight Line Program (SLP). The algorithm runs in O …

We exhibit combinatorial results on Christoffel words and binary balanced words that are
motivated by their geometric interpretation as approximations of digital segments. We give a …

We review some recent results in digital geometry obtained by using a combinatorics on
words approach to discrete geometry. Motivated on the one hand by the well-known theory …

Recently, large quantities of data is produced every day, such as web pages, sensor data,
social media data, digital pictures and videos, purchase transaction records, and so on …

Dossier de candidature pour le poste de Maˆıtre de conférences Page 1 Dossier de candidature
pour le poste de Maˆıtre de conférences Xavier Provençal 4 rue Thomas 34000 Montpellier …