This is an introduction for undergraduates to the theory of computation which emphasizes formal languages, automata, and abstract models of computation and computability. It also includes an introduction to computational complexity and NP-completeness. Key features of the book includes: numerous examples and informal discussions; extended discussion of mathematical induction; an introduction to computational complexity; and inclusion of Ogden's Lemma.
Auflage
International 2 Revised ed
Sprache
Verlagsort
Verlagsgruppe
McGraw-Hill Education - Europe
Zielgruppe
Für höhere Schule und Studium
Maße
Gewicht
ISBN-13
978-0-07-115468-0 (9780071154680)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Mathematical notation and techniques; regular languages and finite automata; context-free languages and pushdown automata; Turing machines and their languages; unsolvable problems and computable functions.
