Automatic sequences are sequences over a finite alphabet generated by a finite-state
machine. This book presents a novel viewpoint on automatic sequences, and more …

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

We present an algorithm which produces, in some cases, infinite words avoiding both large
fractional repetitions and a given set of finite words. We use this method to show that all the …

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

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 …

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

We study finite-state transducers and their power for transforming infinite words. Infinite
sequences of symbols are of paramount importance in a wide range of fields, from formal …

Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the
smallest real number α such that there exists an infinite word over a k-letter alphabet that …

This paper approaches the combinatorial problem of Thue freeness for partial words. Partial
words are sequences over a finite alphabet that may contain a number of “holes”. First, we …

The stabilizer of an infinite word w over a finite alphabet Σ is the monoid of morphisms over Σ
that fix w. In this paper we study various problems related to stabilizers and their generators …