| Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science Revised Edition Contributor(s): Davis, Martin (Author), Sigal, Ron (Author), Weyuker, Elaine J. (Author) |
|
 |
ISBN: 0122063821 ISBN-13: 9780122063824 Publisher: Morgan Kaufmann Publishers OUR PRICE: $72.22 Product Type: Hardcover - Other Formats Published: February 1994 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Logic - Computers | Programming Languages - General - Computers | Computer Science |
| Dewey: 511.3 |
| LCCN: 93026807 |
| Series: Computer Science and Scientific Computing |
| Physical Information: 1.87" H x 6.44" W x 9.26" (2.42 lbs) 609 pages |
| Descriptions, Reviews, Etc. |
| Publisher 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. |