Close this alert
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)
Current price:
$102.13
This product is not returnable.
Publication Date: February 3rd, 1994
Publisher:
Morgan Kaufmann Publishers
ISBN:
9780122063824
Pages:
609
Usually Ships in 1 to 5 Days
Description
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.
Other Books in Series
Linear Programs & Related Problems: A Volume in the Computer Science and Scientific Computing Series
Hardcover
The Theory of Matrices: With Applications (Computer Science and Scientific Computing)
Hardcover
Matrix Perturbation Theory (Computer Science and Scientific Computing)
Hardcover
The Theory of Matrices: With Applications (Computer Science and Scientific Computing)
Paperback
Linear Programs & Related Problems: A Volume in the Computer Science and Scientific Computing Series
Paperback
Matrix Perturbation Theory (Computer Science and Scientific Computing)
Paperback