Computability, Complexity, and Languages
Fundamentals of Theoretical Computer Science
- Martin Davis
- Ron Sigal
- Elaine Weyuker
This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.
Junior, senior, and graduate level students in Computability, Complexity, and Languages or Introduction to Theoretical Computer Science courses.