{ "item_title" : "Automata and Computability", "item_author" : [" Dexter C. Kozen "], "item_description" : "This introduction to the basic theoretical models of computability develops their rich and varied structure. The first part is devoted to finite automata and their properties. Afterwards, pushdown automata are utilized as a broader class of models, enabling the analysis of context-free languages. In the remaining chapters, Turing machines are introduced, and the book culminates in discussions of effective computability, decidability, and Godel's incompleteness theorems.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/38/794/907/0387949070_b.jpg", "price_data" : { "retail_price" : "89.99", "online_price" : "89.99", "our_price" : "89.99", "club_price" : "89.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details