
This book presents a synthesis of the latest developments in the mathematical theory of data processing. It discusses the fundamental results of the theory of finite automata and of rational languages and examines the recent concept of variety of languages which formalises the connections between finite automata, recognizable languages and finite semigroups.
The first four chapters of the book are devoted to the fundamental results of the theory of automata and are illustrated by numerous examples. The final chapter contains the most recent results of the theory (but without the proof). The reader does not require any previous knowledge of formal languages or automat, although a certain familiarity with algebra is called for.