Automata Theory and its Applications (Progress in Computer Science and Applied Logic (21))

Khoussainov, Bakhadyr, Nerode, Anil

ISBN 10: 1461266459 / ISBN 13: 9781461266457

Verlag: Birkhäuser, 2012

Beschreibung

Like New.

Bestandsnummer des Verkäufers ERICA77314612664596

Bibliografische Details

• Titel: Automata Theory and its Applications (Progress in Computer Science and Applied Logic (21))
• Verlag: Birkhäuser
• Veröffentlichungsdatum: 2012
• Sprache: Englisch
• ISBN-10: 1461266459
• ISBN-13: 9781461266457
• Bindung: Paperback
• Zustand: Like New
• Buchtyp: book

Über diesen Titel

Inhaltsangabe

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. Beginning with coverage of all standard fundamental results regarding finite automata, the book deals in great detail with Büchi 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. Self-contained with numerous examples, illustrations, exercises. Suitable for a two-semester undergraduate course for computer science or math majors, or for a one-semester graduate course/seminar. No advanced mathematical background is required, thus 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.

Críticas

"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