Automata Theory and its Applications is a uniform treatment of the
theory of finite state machines on finite and infinite strings and
trees. Many books deal with automata on finite strings, but there
are very few expositions that prove the fundamental results of
automata on infinite strings and trees. These results have
important applications to modeling parallel computation and
concurrency, the specification and verification of sequential and
concurrent programs, databases, operating systems, computational
complexity, and decision methods in logic and algebra. Thus, this
textbook fills an important gap in the literature by exposing early
fundamental results in automata theory and its applications.
Beginning with coverage of all standard fundamental results
regarding finite automata, the book deals in great detail with
BA1/4chi and Rabin automata and their applications to various
logical theories such as S1S and S2S, and describes game-theoretic
models of concurrent operating and communication systems.
The book is self-contained with numerous examples,
illustrations, exercises, and is suitable for a two-semester
undergraduate course for computer science or mathematics majors, or
for a one-semester graduate course/seminar. Since no advanced
mathematical background is required, the text is also useful for
self-study by computer science professionals who wish to understand
the foundations of modern formal approaches to software
development, validation, and verification.
General
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!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
