Many Computation Engineering textbooks emphasize automata theory only, not logic, losing a the opportunity to tie these subjects together and reinforce learning. This textbook ties theory and logic together, using interactive tools, 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.

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.

Approaches automata theory and logic as the underlying engineering mathematics for Computation Engineering Covers classical topics such as the Rice's Theorem, as well as modern topics such as Model checking, Buchi Automata, and temporal Logic Restores the Automaton-Logic connection missing in most undergraduate books on automata theory Employs many interactive tools to illustrate key concepts Includes supplementary material: sn.pub/extras

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