{"product_id":"9783031847394","title":"An Introduction to Theory of Computation: An Algorithmic Approach","description":"\u003ch1\u003eAn Introduction to Theory of Computation: An Algorithmic Approach\u003c\/h1\u003e \u003ch2\u003eOgihara, Mitsunori\u003c\/h2\u003e \u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis textbook aims to provide a comprehensive introduction to the theory of computation for upper-level undergraduate students and first-year graduate students in computer science and related disciplines. It covers a wide range of foundational topics essential for understanding the principles and applications of computation.\u003c\/p\u003e\n\n\u003cp\u003eThe book begins with regular languages, exploring finite automata, nondeterministic finite automata, regular expressions, and the equivalence among these apparatuses. It explores state minimization and the Myhill-Nerode Theorem, offering techniques such as pumping lemmas to identify non-regular languages and using the Myhill-Nerode Theorem for non-regularity proofs. Additionally, the closure properties of regular languages are examined.\u003c\/p\u003e\n\n\u003cp\u003eContext-free languages are another focal point, where the text discusses context-free grammars, Chomsky normal form grammars, pushdown automata, and their equivalences. The book includes pumping lemmas and closure properties using CNF grammars and PDA analysis, as well as identifying non-context-free languages and understanding leftmost derivations.\u003c\/p\u003e\n\n\u003cp\u003eTuring machine models are thoroughly covered, with various models and simulations explained. The book outlines configurations, the Church-Turing Thesis, and differentiates between recursive and recursively enumerable languages.\u003c\/p\u003e\n\n\u003cp\u003eDecidability and undecidability are critical topics in the text, addressing decidable problems, diagonalization, the halting problem, and Rice’s Theorem. It also provides a characterization of decidability, discusses the Post Correspondence Problem, and examines the lower levels of the arithmetical hierarchy.\u003c\/p\u003e\n\n\u003cp\u003eThe textbook also delves into computational complexity classes, defining time and space complexity classes, and presenting efficient simulations and hierarchy theorems, including the Hennie-Stearns Theorem. It includes examples of problems in P and NP, providing a clear understanding of these classifications.\u003c\/p\u003e\n\n\u003cp\u003eNP-completeness is explored in detail, covering SAT and 3SAT, canonical complete problems, and various NP-complete problems. The book extends to space complexity classes, discussing PSPACE complete problems, NL-complete problems, and proving that NL=coNL.\u003c\/p\u003e\n\n\u003cp\u003eFinally, the text ventures beyond NP-completeness, discussing Ladner’s construction of non-NPC sets, randomized complexity classes, and concepts such as BPP and the polynomial hierarchy. It also examines polynomial size circuits, providing a comprehensive view of the landscape of computational complexity.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2025-04-08\u003c\/p\u003e \u003cp\u003eFormat: Hardcover\u003c\/p\u003e \u003cp\u003eISBN-13: 9783031847394\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-3-031-84740-0\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 382\u003c\/p\u003e ","brand":"Springer Nature Switzerland","offers":[{"title":"Default Title","offer_id":45666485174412,"sku":"9783031847394","price":80.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783031847394.jpg?v=1776097093","url":"https:\/\/fh90cf-fv.myshopify.com\/products\/9783031847394","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}