Infinite Words: Automata, Semigroups, Logic and Games

Front Cover
Academic Press, Feb 12, 2004 - Mathematics - 550 pages
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Preface
1
Chapter I AUTOMATA AND INFINITE WORDS
5
Chapter II AUTOMATA AND SEMIGROUPS
75
Chapter III AUTOMATA AND TOPOLOGY
133
Chapter IV GAMES AND STRATEGIES
187
Chapter V WAGNER HIERARCHY
215
Chapter VI VARIETIES
265
Chapter VII LOCAL PROPERTIES
307
Chapter IX BIINFINITE WORDS
381
Chapter X INFINITE TREES
413
ANNEX A FINITE SEMIGROUPS
435
ANNEX B VARIETIES OF FINITE SEMIGROUPS
465
References
499
List of Tables
523
List of Figures
525
Index
531

Chapter VIII AN EXCURSION INTO LOGIC
327

Other editions - View all

Common terms and phrases

Popular passages

Page 3 - We wish to express our gratitude to all those who have helped us in the preparation of this paper.

About the author (2004)

Dominique Perrin is Professor in Computer Science at the University of Marne-la-Vallee, France, and director of ESIEE Engineering, Paris. He is a member of Academia Europea.

Bibliographic information