Review3 Automata theory and its applications Authors: Bakhadyr Khoussainov and Anil Nerode Progress in Computer Science and Applied Logic, 21. Birkh user Boston, Inc., Boston, MA a 2001. xiv+430 pp. $69.95. ISBN 0-8176-4207-2 And Automata, Logics, and In nite Games Edited by E. Gr del, W. Thomas, and T. Wilke a Springer-Verlag, LNCS 2500 385 pp. ISBN 3-540-00388-6. Reviews by Lawrence S. Moss Dept. of Math Indiana University, Bloomington, IN 47405-5701 USA and Hans-J rg Tiede o Dept of Math and CS Illinois Wesleyan University, Bloomington, IL 61702-2900 USA Introduction Although basic automata theory has spawned lots of books, and is a mainstay of theoretical and even practical computer science, advanced parts of the subject have not as yet had a strong impact on the computer science curriculum. Some of them have had applications, especially in model checking and veri cation. The books under review can serve as textbooks in formal foundations of model checking and veri cation, and at the same time they are texts in advanced automata theory. Automata theory has been generalized in many ways: from nite state to various forms of memory, from deterministic to non-deterministic and then alternating, from non-stochastic to probabilistic, from
/lp/association-for-computing-machinery/review-of-automata-theory-and-its-applications-by-bakhadyr-khoussainov-NEjlCZn0n5