Infinite Words: Automata, Semigroups, Logic and Games (Volume 141) (Pure and Applied Mathematics, Volume 141)

Infinite Words is an important theory in both Mathematics and Computer Sciences. Many new developments have been made in the field, encouraged by its application to problems in computer science. Infinite Words is the first manual devoted to this topic.

Infinite Words explores all aspects of the theory, including Automata, Semigroups, Topology, Games, Logic, Bi-infinite Words, Infinite Trees and Finite Words. The book also looks at the early pioneering work of Büchi, McNaughton and Schützenberger.

Serves as both an introduction to the field and as a reference book.
Contains numerous exercises desgined to aid students and readers.
Self-contained chapters provide helpful guidance for lectures.

Infinite Words covers all aspects of the theory of Infinite Words; from basic results to more advanced topics.Being the very first comprehensive treatment of 'Infinite Words', this book is the reference for researchers and graduates in this field. Following the pioneering work of Büchi, McNaughton and Schützenberger, many new developments have been made in the field of Infinite Words due to its relevance in the interplay between theory and its applications.Key Features* A methodical presentation of the subject and its connections with logic, topology and algorithms.* Includes recent developments in the theory of games.* Serves as both an introduction to the field and as a reference book.* Contains numerous exercises designed to aid students and readers, furthering their understanding of the field.* Self-contained chapters provide helpful guidance for lectures.Dominique Perrin is Professor of Mathematics and Computer Science at l'Université de Marne la Vallée, France. He has published a number of research papers in the fields of automata theory, variable length codes and combinatorics on Words. In 1985, Professor Perrin joined with Jean Berstel to publish another Academic Press title, Theory of Codes, the pair later co-edited the two-volume Combinatorics on Words.Jean-Éric Pin is Director of Research at C.N.R.S., Laboratoire d'Informatique Algorithmique, Fondements et Applications, Université Denis Diderot, Paris, France. He has published over one hundred articles in automata and semigroup theory. In 1989, he received the IBM France Scientific Prize in Computer Science for his work in automata theory.