Automata Theory and its Applications
By Bakhadyr Khoussainov, Anil Nerode
Language: English
Category: Ebook - Math/Science/Tech
Categories: Science
Uploader: shenglee42
Uploaded At: 2025-02-19 23:05:58
2001, theoretical computer science, computation
Description
The theory of finite automata on finite stings, infinite strings, and trees has had a distinguished 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.
But when the senior author has asked his students to learn these subjects from available textbooks and papers on automata, they have ended up all over the literature trying to put together a coherent exposition. The authors decided to fill this gap with a single self-contained book.
This book is a text suitable for a one or two semester course for computer science or mathematics majors, or for a semester graduate course or seminar. The book introduces at the beginning the rudimentary set theory needed, which can be skipped by most readers, advances slowly through the theory of finite automata, and then progresses to the more advanced subjects and some of their applications.