did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

Automata, Computability and Complexity Theory and Applications

9780132288064

Automata, Computability and Complexity Theory and Applications

  • ISBN 13:

    9780132288064

  • ISBN 10:

    0132288060

  • Edition: 1st
  • Format: Hardcover
  • Copyright: 09/18/2007
  • Publisher: Pearson

List Price $206.65 Save

Rent $122.75
TERM PRICE DUE
Added Benefits of Renting

Free Shipping Both Ways Free Shipping Both Ways
Highlight/Take Notes Like You Own It Highlight/Take Notes Like You Own It
Purchase/Extend Before Due Date Purchase/Extend Before Due Date

List Price $206.65 Save $55.63

Used $151.02

Usually Ships in 24-48 Hours

We Buy This Book Back We Buy This Book Back!

Included with your book

Free Shipping On Every Order Free Shipping On Every Order

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Extend or Purchase Your Rental at Any Time

Need to keep your rental past your due date? At any time before your due date you can extend or purchase your rental through your account.

Summary

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.

Author Biography

Read more