The book deals with the theory of finite automata and classical results such as the theorems of Richard Büchi and Michael Rabin. The four parts of the book are dedicated to different structures: finite words, trees, finite and infinite trees. Each part concludes with exercises related to the material covered, as well as references to further literature. If prior knowledge of formal language theory is available, the book can be worked through without additional aids.