Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Revised)

product image
$110.00
This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.
ISBN: 
9780122063824
Binding: 
Hardcover
Publication Date: 
February 17, 1994