{"product_id":"problem-solving-in-automata-languages-and-comp-complexity-9780471439608","title":"Problem Solving in Automata Languages and Comp","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003eLanguage theory, automata, and complexity theory are essential topics in the field of computer science. In this volume, two established experts offer practical, accessible coverage of these issues with an emphasis on problem-solving skills.\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTrade Review\u003c\/b\u003e\u003cbr\u003e\"Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text…\" (\u003ci\u003eIEEE Circuits \u0026amp; Devices\u003c\/i\u003e, July\/August 2004)  \u003cp\u003e\"...uses a problem-solving approach that makes these computer languages concrete...\" (\u003ci\u003eSciTech Book News\u003c\/i\u003e, Vol. 25, No. 4, December 2001)\u003c\/p\u003e\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTable of Contents\u003c\/b\u003e\u003cbr\u003ePreface.\u003cbr\u003e \u003cbr\u003e Leverages.\u003cbr\u003e \u003cbr\u003e Finite Automata.\u003cbr\u003e \u003cbr\u003e Context-Free Languages.\u003cbr\u003e \u003cbr\u003e Turing Machines.\u003cbr\u003e \u003cbr\u003e Computability Theory.\u003cbr\u003e \u003cbr\u003e Computational Complexity.\u003cbr\u003e \u003cbr\u003e NP-Completeness.\u003cbr\u003e \u003cbr\u003e References.\u003cbr\u003e \u003cbr\u003e Index.","brand":"John Wiley \u0026 Sons Inc","offers":[{"title":"Default Title","offer_id":49402593706327,"sku":"9780471439608","price":131.35,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0817\/1739\/5799\/files\/9780471439608.jpg?v=1730480897","url":"https:\/\/bookcurl.com\/products\/problem-solving-in-automata-languages-and-comp-complexity-9780471439608","provider":"Book Curl","version":"1.0","type":"link"}