This 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. The book begins with regular languages, exploring finite automata, nondeterministic finite automata, regular expressions, and the equivalence among these apparatuses. It explores state minimization and ...
Read More
This 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. The 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. Context-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. Turing 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. Decidability 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. The 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. NP-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. Finally, 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.
Read Less
Add this copy of An Introduction to Theory of Computation: an to cart. $56.50, fair condition, Sold by Marlton Books LLC rated 4.0 out of 5 stars, ships from new york, NY, UNITED STATES, published 2025 by Springer International Publishing AG.
Add this copy of An Introduction to Theory of Computation: an to cart. $57.57, very good condition, Sold by Books From California rated 4.0 out of 5 stars, ships from Simi Valley, CA, UNITED STATES, published 2025 by Springer.
Add this copy of An Introduction to Theory of Computation: An to cart. $79.84, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2025 by Springer International Publishing AG.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Contains: Illustrations, black & white, Illustrations, color. XXIII, 382 p. 103 illus., 22 illus. in color. Intended for college/higher education audience.
Add this copy of An Introduction to Theory of Computation: An to cart. $85.95, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2025 by Springer International Publishing AG.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Contains: Illustrations, black & white, Illustrations, color. XXIII, 382 p. 103 illus., 22 illus. in color. Intended for college/higher education audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
