Computation Engineering: Applied Automata Theory and Logic

Ganesh Gopalakrishnan

ISBN 10: 0387244182 / ISBN 13: 9780387244181

Verlag: Springer US, 2006

Beschreibung

Approaches automata theory and logic as the underlying engineering mathematics for Computation EngineeringCovers classical topics such as the Rice s Theorem, as well as modern topics such as Model checking, Buchi Automata, and temporal Logic.

Bestandsnummer des Verkäufers 458428370

Bibliografische Details

• Titel: Computation Engineering: Applied Automata Theory and Logic
• Verlag: Springer US
• Veröffentlichungsdatum: 2006
• Sprache: Englisch
• ISBN-10: 0387244182
• ISBN-13: 9780387244181
• Bindung: Gebunden
• Zustand: New

Über diesen Titel

Inhaltsangabe

Although it is critical in today's world that students who take automata theory and logic courses retain what they have learned and understand how to use their knowledge, many textbooks typically emphasize automata theory only, not logic, thus losing a valuable opportunity to tie these subjects together and reinforce learning. This textbook uses interactive tools throughout, such as simple BDD and SAT tools. By providing a blend of theory and practical applications the material is presented as both inviting and current. Key concepts are illustrated in multiple domains so that information is reinforced and students can begin to tie theory and logic together.

Von der hinteren Coverseite

"This classroom-tested undergraduate textbook is unique in presenting logic and automata theory as a single subject...I highly recommend this book to you as the best route I know into the concepts underlying modern industrial formal verification." - Dr. Michael J.C. Gordon FRS, The University of Cambridge Computer Laboratory

 

"This is a valuable book in my opinion.  I learned a good deal from reading it, and encountered many attractive topic treatments and fresh insights, throughout.  I certainly plan to add it to my reference shelf and recommend it to my students and colleagues.  It covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field.  In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented.  The book is well organized for coordinated use in several courses, ranging from core udnergraduate to senior and graduate level topics." - Professor Steven D. Johnson, Indiana University