Automata, Computability, and Complexity: Theory and Applications by Elaine Rich. Section Chapter Link Information for students Information for instructors. Automata, computability and complexity: theory and applications / Elaine Rich. Author. Rich, Elaine. Published. Upper Saddle River, N.J.: Pearson Prentice. Automata, computability and complexity: theory and applications / Elaine Rich Rich, Elaine Finite state machines and regular languages; Context-free languages and pushdown automata; Turing machines and undecidability; Complexity.
|Published (Last):||28 April 2006|
|PDF File Size:||3.4 Mb|
|ePub File Size:||9.65 Mb|
|Price:||Free* [*Free Regsitration Required]|
Goodreads helps you keep track of books you want to read.
Automata, Computability and Complexity: Theory and Applications
Want to Read saving…. Want to Read Currently Reading Read. Refresh and try again. Open Preview See a Problem? Thanks for telling us about autkmata problem. Return to Book Page.
Automata, Computability and Complexity: Theory and Applications by Elaine A. 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 The theoretical underpinnings of computing form a standard part of almost every computer science curriculum.
The book is organized into a core set of chapters that cover the standard material suggested by the titlefollowed 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 HMMsregular 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. Hardcoverpages. To see what your friends thought of this book, please sign up. To ask other readers questions about Automata, Computability and Complexityplease sign up.
Be the first to ask a question about Automata, Computability and Complexity. Lists with This Book. This book is not yet featured on Listopia. Sep 18, Nagaraj rated it it was amazing. Aug 31, Gaurav Ganguly rated it it was amazing.
It’s a Great Book. Aug 24, Rod Hilton rated it it was amazing Shelves: CLRS never goes terribly deep into it’s algorithms, but it provides an extremely wide breadth of material backed by solid explanations and clear prose.
Automata, computability and complexity : theory and applications (Book, ) 
While the Sipser book probably remains my favorite book on Theory and Automata, Rich’s book definitely covers more, and definitely covers it at a slower pace, making sure not to lose students. Sipser’s book is excellent as long as you can follow along, but if something comes along that doesn’t make sense to you, the book offers you no assistance.
Rich, on the other hand, takes more time to explain things to make sure they are clear. As a result of this slower pace and wider variety of material, Rich’s book is certainly larger and more intimidating.
I think Rich’s book makes for a better desk reference than a tutorial like CLRSthough I have to note that Rich’s writing style is excellent and clear, so it doesn’t make for a poor tutorial text at all. Rich covers lots of complexity-related topics that Sipser barely mentions as well, so this book makes a great reference for basic complexity theory.
I can’t really fault this book for doing what everyone else does, but I felt I had to mention it. May 21, Nick Luchsinger rated it it was amazing Shelves: I’m completely biased, because I took an automata class from Elaine Rich and tutored for the class for a couple years as well, but I really enjoyed this book and found it to be pretty well-balanced between formal rigor and practical readability. Jun 13, Pieter rated it really liked it Shelves: Pretty good for a technical book about a very dry subject.
Feb 19, Wouter Pinnoo rated it it was amazing. Jun 11, Tom Naessens rated it really liked it. C rated it really liked it Jul 08, Anish rated it it was amazing Dec 25, Yesajum rated it it was amazing Dec 24, Chaithra rated it it was ok Oct 01, Hicham Elmongui rated it liked it Apr 30, Saganaut rated it really liked it Mar 22, Manoj Kumar rated it it was amazing Aug 08, Ashrita Kashyap rated it it was amazing Aug 11, Alex Weibel rated it really liked it Dec 04, Chet rated it really liked it Nov 23, Mohammedmoin rated it really liked it Dec 12, Kavana Mv rated it did not like it Sep 07, A rated it liked it Mar 29, Nicolas rated it really liked it Aug 31, Prakruth rated it it was amazing Jul 31, Bilal Rafique rated it it was amazing Aug 18, Hemanth rated it it was amazing Dec 25, Sanket rated it liked it Oct 28, Meghana Gowdru rated it did not like it Oct 29, Sushma Hr rated it really liked it Jul 06, Gnanendra Hell Rider rated it really liked it Aug 15, Vinayaka rated it it was amazing Sep 29, There are no discussion topics on this book yet.
If you like books and love to build cool products, we may be looking for you.
Trivia About Automata, Computa No trivia or quizzes yet. Just a moment while we sign you in to your Goodreads account.