This collaborative volume presents recent trends arising from the fruitful interaction between
the themes of combinatorics on words, automata and formal language theory, and number …

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 …

We show that various aspects of k-automatic sequences—such as having an unbordered
factor of length n—are both decidable and effectively enumerable. As a consequence it …

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

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

Recently, symbolic program analysis techniques have been extended to quantitative
analyses using model counting constraint solvers. Given a constraint and a bound, a model …

In this paper we prove the decidability of the following problem: Input: Two finite alphabets A
and B, an endomorphism σ: A∗→ A∗, a word w∈ A∗ and a morphism φ: A∗→ B∗ …

We develop a generic technique to compute minimal separating DFAs (deterministic finite
automata) and regular invariants. Our technique works by expressing the desired properties …

We introduce FPSOLVE, an implementation of generic algorithms for solving fixpoint
equations over semirings. We first illustrate the interest of generic solvers by means of a …

This work studies the properties of finite automata recognizing vectors with real components,
encoded positionally in a given integer numeration base. Such automata are used, in …