Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, 2nd Edition

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, 2nd Edition
Summary
Computability, Complexity, and Languages is an introductory text that 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.