Computation Engineering Applied Automata Theory and Logic /

• Κύριος συγγραφέας: Gopalakrishnan, Ganesh (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Boston, MA : Springer US, 2006.
• Θέματα: Computer science.; Computers.; Mathematical logic.; Electrical engineering.; Electronic circuits.; Computer Science.; Theory of Computation.; Circuits and Systems.; Mathematical Logic and Formal Languages.; Electrical Engineering.

 "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. 

 Mathematical Preliminaries -- Cardinalities and Diagonalization -- Binary Relations -- Mathematical Logic, Induction, Proofs -- Dealing with Recursion -- Strings and Languages -- Machines, Languages, DFA -- NFA and Regular Expressions -- Operations on Regular Machinery -- The Automaton/Logic Connection, Symbolic Techniques -- The ‘Pumping’ Lemma -- Context-free Languages -- Push-down Automata and Context-free Grammars -- Turing Machines -- Basic Undecidability Proofs -- Advanced Undecidability Proofs -- Basic Notions in Logic including SAT -- Complexity Theory and NP-Completeness -- DFA for Presburger Arithmetic -- Model Checking: Basics -- Model Checking: Temporal Logics -- Model Checking: Algorithms -- Conclusions.