Walnut is a software package that implements a mechanical decision procedure for deciding
certain combinatorial properties of some special words referred to as automatic words or …

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 …

The notion of synchronized sequence, introduced by Carpi and Maggi in 2002, has turned
out to be a very useful tool for investigating the properties of words. Moreover, if sequence is …

We implement a decision procedure for answering questions about a class of infinite words
that might be called (for lack of a better name)“Fibonacci-automatic”. This class includes, for …

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 …

We show how some problems in additive number theory can be attacked in a novel way,
using techniques from the theory of finite automata. We start by recalling the relationship …

We show that it is decidable, given an automatic sequence $\bf s $ and a constant $ c $,
whether all prefixes of $\bf s $ have a string attractor of size $\leq c $. Using a decision …

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 continue our study of the class of Fibonacci-automatic words. These are infinite words
whose n th term is defined in terms of a finite-state function of the Fibonacci representation of …