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 …

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 …

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 …

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 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 …

There exist various well-known characterizations of sets of numbers recognizable by a finite
automaton, when they are represented in some integer base p⩾ 2. We show how to modify …

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

Theory of Computing Systems Page 1 Theory Comput. Systems 31, 111–133 (1998) Theory
of Computing Systems © 1998 Springer-Verlag New York Inc. Greedy Numeration Systems …

Shift radix systems provide a unified notation to study several important types of number
systems. However, the classification of such systems is already hard in two dimensions. In …

We extend the notion of k-automatic sequences to Ostrowski-automatic sequences, and
develop a procedure to computationally decide certain combinatorial and enumeration …