Automata Theory and its Applications

1. Front Matter

   Pages i-xiv

   PDF

2. Basic Notions

   • Bakhadyr Khoussainov, Anil Nerode

   Pages 1-38

3. Finite Automata

   • Bakhadyr Khoussainov, Anil Nerode

   Pages 39-120

4. Büchi Automata

   • Bakhadyr Khoussainov, Anil Nerode

   Pages 121-207

5. Games Played on Finite Graphs

   • Bakhadyr Khoussainov, Anil Nerode

   Pages 209-247

6. Rabin Automata

   • Bakhadyr Khoussainov, Anil Nerode

   Pages 249-328

7. Applications of Rabin Automata

   • Bakhadyr Khoussainov, Anil Nerode

   Pages 329-401

8. Back Matter

   Pages 403-432

   PDF

The theory of finite automata on finite stings, infinite strings, and trees has had a dis­ tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us­ ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata.

• Automat
• automata
• complexity
• finite automata
• logic
• modeling
• verification

"The aim of this book is to present a theory of several types of automata and applications of these facts in logic, concurrency and algebra. ...The book contains suitable material for a two-semester course for students of computer science or mathematics. It is completely self-contained and one can really enjoy reading it. It is strongly recommended for researchers and postgraduate students interested in logic, automata and/or concurrency."

--EMS

• Department of Computer Science, The University of Auckland, Auckland, New Zealand

  Bakhadyr Khoussainov

• Department of Mathematics, Cornell University, Ithaca, USA

  Anil Nerode

Policies and ethics