{
"item_title" : "Computability, Complexity, and Languages",
"item_author" : [" Martin Davis", "Ron Sigal", "Elaine J. Weyuker "],
"item_description" : "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.",
"item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/12/206/382/0122063821_b.jpg",
"price_data" : {
"retail_price" : "72.95", "online_price" : "72.95", "our_price" : "72.95", "club_price" : "72.95", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780122063824
- ISBN-10: 0122063821
- Publisher: Morgan Kaufmann Publishers
- Publish Date: February 1994
- Dimensions: 9.26 x 6.44 x 1.87 inches
- Shipping Weight: 2.42 pounds
- Page Count: 609
Related Categories
