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 …

Regular languages and finite automata are among the oldest topics in formal language
theory. The formal study of regular languages and finite automata can be traced back to the …

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 …

Mathematical Foundations of Automata Theory Page 1 Mathematical Foundations of Automata
Theory Jean-Éric Pin Version of February 18, 2022 Page 2 Page 3 Preface These notes form …

Research on information extraction from Web pages (wrap**) has seen much activity
recently (particularly systems implementations), but little work has been done on formally …

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 …

A structure has a (finite-string) automatic presentation if the elements of its domain can be
named by finite strings in such a way that the coded domain and the coded atomic …

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

Automatic structures: overview and future directions: Journal of Automata, Languages and
Combinatorics: Vol 8, No 2 skip to main content ACM Digital Library home ACM Association for …

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