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

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 …

Generalizations of positional number systems in which N is recognizable by finite automata
are obtained by describing an arbitrary infinite regular language according to the …

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 …

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 …

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 consider extensions and restrictions of Wythoff's game having exactly the same set of P
positions as the original game. No strict subset of rules gives the same set of P positions. On …

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