Automata Theory and its Applications (Paperback, Softcover reprint of the original 1st ed. 2001)

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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Progress in Computer Science and Applied Logic, 21
Release date:	November 2012
First published:	2001
Authors:	Bakhadyr Khoussainov • Anil Nerode
Dimensions:	235 x 155 x 23mm (L x W x T)
Format:	Paperback
Pages:	432
Edition:	Softcover reprint of the original 1st ed. 2001
ISBN-13:	978-1-4612-6645-7
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > Computer programming > Software engineering Books > Science & Mathematics > Mathematics > Mathematical foundations > General Books > Computing & IT > Applications of computing > Artificial intelligence > General Promotions
LSN:	1-4612-6645-9
Barcode:	9781461266457

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!