Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Hardcover
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science - Hardcover
$138.31
/
products.product.pickup_availability.unavailable
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
by Martin Davis (Author), Ron Sigal (Author), Elaine J. Weyuker (Author)
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.
Back Jacket
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.
