This unique compendium highlights the theory of computation, particularly logic and automata theory. Special emphasis is on computer science applications including loop invariants, program correctness, logic programming and algorithmic proof techniques. This innovative volume differs from standard textbooks, by building on concepts in a different order, using fewer theorems with simpler proofs. It has added many new examples, problems and answers. It can be used as an undergraduate text at most universities. Request Inspection Copy Sample Chapter(s) Preface Chapter 1: Mathematical Preliminaries Contents: Preface About the Author Mathematical Preliminaries Logic for Computer Science: Propositional Logic Proofs by Deduction Predicate Logic Proofs with Predicates Program Verification Language Models for Computer Science: Language and Models Generating Regular Languages Finite Automata Context-Free Grammars Pushdown Automata and Parsing Turing Machines Appendices: Logic Programming The AWK Language Answers to Selected Problems Bibliography Index Readership: Researchers, professionals, academics, and graduate students in theoretical computer science.