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.
Read More
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.
Read Less
