9780132288064-0132288060-Automata, Computability and Complexity: Theory and Applications

Automata, Computability and Complexity: Theory and Applications

ISBN-13: 9780132288064
ISBN-10: 0132288060
Edition: 1
Author: Elaine A. Rich
Publication date: 2007
Publisher: Pearson
Format: Hardcover 1120 pages
FREE US shipping on ALL non-marketplace orders
Rent
35 days
from $23.77 USD
FREE shipping on RENTAL RETURNS
Marketplace
from $23.07 USD
Buy

From $23.07

Rent

From $23.77

Book details

ISBN-13: 9780132288064
ISBN-10: 0132288060
Edition: 1
Author: Elaine A. Rich
Publication date: 2007
Publisher: Pearson
Format: Hardcover 1120 pages

Summary

Automata, Computability and Complexity: Theory and Applications (ISBN-13: 9780132288064 and ISBN-10: 0132288060), written by authors Elaine A. Rich, was published by Pearson in 2007. With an overall rating of 4.0 stars, it's a notable title among other Information Theory (Computer Science, Mathematics) books. You can easily purchase or rent Automata, Computability and Complexity: Theory and Applications (Hardcover) from BooksRun, along with many other new and used Information Theory books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $1.53.

Description

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.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book