The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the classic treatment of this material isolates it from the myriad ways in which the theory influences the design of modern hardware and software systems. The goal of this book is to change that. The book is organized into a core set of chapters (that cover the standard material suggested by the title), followed by a set of appendix chapters that highlight application areas including programming language design, ...
Read More
The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the classic treatment of this material isolates it from the myriad ways in which the theory influences the design of modern hardware and software systems. The goal of this book is to change that. The book is organized into a core set of chapters (that cover the standard material suggested by the title), followed by a set of appendix chapters that highlight application areas including programming language design, compilers, software verification, networks, security, natural language processing, artificial intelligence, game playing, and computational biology. The core material includes discussions of finite state machines, Markov models, hidden Markov models (HMMs), regular expressions, context-free grammars, pushdown automata, Chomsky and Greibach normal forms, context-free parsing, pumping theorems for regular and context-free languages, closure theorems and decision procedures for regular and context-free languages, Turing machines, nondeterminism, decidability and undecidability, the Church-Turing thesis, reduction proofs, Post Correspondence problem, tiling problems, the undecidability of first-order logic, asymptotic dominance, time and space complexity, the Cook-Levin theorem, NP-completeness, Savitch's Theorem, time and space hierarchy theorems, randomized algorithms and heuristic search. Throughout the discussion of these topics there are pointers into the application chapters. So, for example, the chapter that describes reduction proofs of undecidability has a link to the security chapter, which shows a reduction proof of the undecidability of the safety of a simple protection framework.
Read Less
Add this copy of Automata, Computability and Complexity: Theory and to cart. $39.46, good condition, Sold by SurplusTextSeller rated 5.0 out of 5 stars, ships from Columbia, MO, UNITED STATES, published 2007 by Pearson.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
Add this copy of Automata, Computability and Complexity: Theory and to cart. $76.96, good condition, Sold by Book Words rated 3.0 out of 5 stars, ships from Midland Park, NJ, UNITED STATES, published 2007 by Pearson.
Add this copy of Automata, Computability and Complexity: Theory and to cart. $80.04, good condition, Sold by Pieuler LLC rated 3.0 out of 5 stars, ships from IPSWICH, SUFFOLK, UNITED KINGDOM, published 2007 by Pearson.
Add this copy of Automata, Computability and Complexity: Theory and to cart. $92.21, good condition, Sold by TEXTSHUB rated 5.0 out of 5 stars, ships from Franklin Lakes, NJ, UNITED STATES, published 2007 by Pearson.
Add this copy of Automata, Computability and Complexity: Theory and to cart. $170.13, new condition, Sold by GridFreed rated 4.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 2007 by Pearson.
Add this copy of Automata, Computability and Complexity: Theory and to cart. $180.70, very good condition, Sold by Book Words rated 3.0 out of 5 stars, ships from Midland Park, NJ, UNITED STATES, published 2007 by Pearson.
Add this copy of Automata, Computability and Complexity: Theory and to cart. $224.29, new condition, Sold by Pieuler LLC rated 3.0 out of 5 stars, ships from IPSWICH, SUFFOLK, UNITED KINGDOM, published 2007 by Pearson.
Add this copy of Automata, Computability and Complexity: Theory and to cart. $309.10, new condition, Sold by Revaluation Books rated 4.0 out of 5 stars, ships from Exeter, DEVON, UNITED KINGDOM, published 2007 by Prentice Hall.
