Automata, Computability and Complexity: Theory and ApplicationsThe 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, contextfree grammars, pushdown automata, Chomsky and Greibach normal forms, contextfree parsing, pumping theorems for regular and contextfree languages, closure theorems and decision procedures for regular and contextfree languages, Turing machines, nondeterminism, decidability and undecidability, the ChurchTuring thesis, reduction proofs, Post Correspondence problem, tiling problems, the undecidability of firstorder logic, asymptotic dominance, time and space complexity, the CookLevin theorem, NPcompleteness, 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. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

Review: Automata, Computability and Complexity: Theory and Applications
User Review  Tom Naessens  GoodreadsVery good & readable book; lots of explanation which aren't too hard to understand or too trivial. Read full review
Review: Automata, Computability and Complexity: Theory and Applications
User Review  Pieter De Baets  GoodreadsPretty good for a technical book about a very dry subject. Read full review
Contents
M02_RICH8064_01_SE_C02  8 
M03_RICH8064_01_SE_C03  21 
M04_RICH8064_01_SE_C04  36 
Copyright  
45 other sections not shown
Common terms and phrases
References from web pages
Pearson  Automata, Computability and Complexity: Theory and ...
Automata, Computability and Complexity: Theory and Applications, Elaine A. Rich. ISBN10: 0132288060 ISBN13: 9780132288064. Publisher: Prentice Hall ...
www.pearsonhighered.com/ educator/ academic/ product/ 0,3110,0132288060,00.html
coursesmart  9780135135662  Automata, Computability and ...
9780135135662  Automata, Computability and Complexity: Theory and Applications  Combining classic theory with unique applications, this crisp narrative is ...
www.coursesmart.com/ 9780135135662?tocview=true
Automata, Computability and Complexity: Theory & Applications
Automata, Computability, and Complexity: Theory and Applications by Elaine Rich. Section Chapter Link Information for students · Information for instructors ...
www.cs.utexas.edu/ ~ear/ cs341/ automatabook/
Bookpool: Automata Computability and Complexity,Theory and ...
Automata Computability and Complexity,Theory and Applications. View Larger Image · Elaine Rich Prentice Hall, Hardcover, Published September 2007, ...
www.bookpool.com/ sm/ 0132288060
Automata, Computability and Complexity : Theory and Applications
textbooksrus.com Save 5090% off New & Used Books and Textbooks. Absolute lowest prices! Free Shipping. Fast Delivery
www.textbooksrus.com/ search/ bookdetail/ ?isbn=9780132288064
Barnes & Noble.com  Books: Automata, Computability and Complexity ...
Automata, Computability and Complexity: Theory and Applications, Rich, Elaine A. Rich, Hardcover, 1, Book, ISBN: 0132288060, Barnes & Noble.com.
search.barnesandnoble.com/ AutomataComputabilityandComplexity/ ElaineARich/ e/ 9780132288064
Libro  Elaine Rich  Automata, Computability and Complexity ...
Titolo: Automata, Computability and Complexity: Theory and Applications; Autore: Elaine Rich; Editore: Pearson Prentice Hall; Data di Pubblicazione: Agosto ...
www.webster.it/ book_usaautomata_computability_and_complexity_theory9780132288064.htm
【楽天市場】Automata, Computability and Complexity: Theory and ...
Automata, Computability and Complexity: Theory and Applications（Automata, Computability ... Automata, Computability and Complexity: Theory and Applications ...
item.rakuten.co.jp/ book/ 4948632/
Algoritam Multimedia Bookshop
AUTOMATA, COMPUTABILITY AND COMPLEXITY: THEORY AND APPLICATIONS. ve a slika. autor: Elaine Rich izdavař: Prentice Hall barcode: 9780132288064 godina: 2007 ...
www.algoritam.hr/ ?m=3&
Librisite
Automata, Computability and Complexity: Theory and Applications. Por Rich, Elaine A., ,. Precio: 112 USD Pasta Dura  1120 Páginas (Agosto 2007) ...
www.librisite.com/ libroimpreso/ esp/ sist/ index.php?tipo=detalle&