Elements of the Theory of Computation

The book introduces the classical and contemporary theory of computation. It has been designed for the use of undergraduates in a way that is mathematically sound yet at the same time does not presuppose special mathematical experience. Provides deeper insight into specific topics in computer science and established essential mathematical paradigms. Includes the theory of automata and formal languages, computability by Turing machines and recursive functions, uncomputability, computational complexity, and mathematical logic. The text includes numerous examples that illustrate the basic concepts and chapter-end problems, which enhance the value of the book.