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.
Betaal eenvoudig met kaart, Klarna, Apple Pay of Google Pay. Niet tevreden? Je hebt altijd 14 dagen bedenktijd. Lees meer in onze voorwaarden. Heb je vragen, mail ons dan via hello@memmo.org.
Memmo maakt studeren makkelijker – waar je ook bent ter wereld. Wij brengen je cursusboeken en slimme studietools samen op één plek: samenvattingen, quizzen, podcasts en flashcards. En Ted, je studievriend die antwoord geeft op alles wat je je afvraagt. Meer dan 50.000 studenten studeren hier al – gebouwd om je sneller te laten leren en minder stress te geven.