{"product_id":"concise-guide-to-computation-theory-9780857295347","title":"Concise Guide to Computation Theory","description":"\u003cp\u003e • Author(s): Akira Maruoka\u003cbr\u003e • Publisher: Springer\u003cbr\u003e • Publisher Imprint: Springer\u003cbr\u003e • BISAC: Computer Science\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e\u003cb\u003eFrom the Back Cover\u003c\/b\u003e\u003cbr\u003e\u003c\/p\u003e\u003cp\u003eComputation lies at the heart of modern digital technology and our increasingly advanced information society. The theory of computation describes what tasks can and cannot be computed, and how efficiently the computable tasks can be computed.\u003c\/p\u003e\u003cp\u003eThis focused and accessible guide\/textbook presents a thorough foundation to the theory of computation, whilst also providing a deeper insight for those looking to pursue research in this field. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Self-contained and supported by practical examples, the text is suitable for a one- or two-semester undergraduate course in the theory of computation.\u003c\/p\u003e\u003cp\u003e\u003cb\u003eTopics and features: \u003c\/b\u003e\u003c\/p\u003e\u003cul\u003e\n\u003cli\u003ePresents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites\u003c\/li\u003e\n\u003cli\u003eProvides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text\u003c\/li\u003e\n\u003cli\u003eDraws upon the author's extensive teaching experience and broad research interests\u003c\/li\u003e\n\u003cli\u003eDiscusses finite automata, context-free languages, and pushdown automata\u003c\/li\u003e\n\u003cli\u003eExamines the concept, universality and limitations of the Turing machine\u003c\/li\u003e\n\u003cli\u003eInvestigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness\u003c\/li\u003e\n\u003c\/ul\u003e\u003cp\u003eThis hands-on and easy-to-read textbook\/reference is ideal for undergraduate students of computer science and related disciplines needing to develop a deep understanding of this fascinating field, even if they have no prior knowledge of the subject.\u003c\/p\u003e\u003cp\u003e\u003cb\u003eDr. Akira Maruoka\u003c\/b\u003e is a professor in the Faculty of Science and Engineering at Ishinomaki Senshu University, Japan.\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Hardcover","offer_id":45274334757015,"sku":"9780857295347","price":3633.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9780857295347.webp?v=1769279619","url":"https:\/\/atlanticbooks.com\/products\/concise-guide-to-computation-theory-9780857295347","provider":"Atlantic Books","version":"1.0","type":"link"}