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.
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.
Pay easily by card, Klarna, Apple Pay or Google Pay. Not happy? You always have a 14-day money-back guarantee. Read more in our terms. If you have any questions, email us at hello@memmo.org.
Memmo makes studying easier – wherever you are in the world. We bring your course books and smart study tools together in one place: summaries, quizzes, podcasts and flashcards. Plus Ted, your study buddy who answers anything you wonder. Over 75,000 students already study here – built to help you learn faster and stress less.