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):||15 September 2008|
|PDF File Size:||9.87 Mb|
|ePub File Size:||6.4 Mb|
|Price:||Free* [*Free Regsitration Required]|
Sign Up Already have an access code? 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.
Finite State Machines and Regular Languages Context-free languages and pushdown automata. Rich has published nine book chapters and 24 refereed papers.
Finite State Machines and Regular Languages Notes Includes bibliographical references and index. Sign In We’re sorry! She was also co-PI on two other grants while at UT: Physical Description xx, p. The specific requirements or preferences of your reviewing publisher, classroom teacher, institution or organization should be applied. Hardcoverpages. Automata, computability and complexity: 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.
Rich, on the other hand, takes more time to explain things to make sure they are clear.
Automata, Computability and Complexity: Theory & Applications
Contents Finite state machines and regular languages Context-free languages and pushdown automata Turing machines and undecidability Complexity. A rated it liked it Mar 29, Pearson Prentice Hall, c Prentice Hall- Computers – pages.
A Language Hierarchy 4. The two gheory have sold overcopies.
Automata, computability and complexity : theory and applications
Chaithra rated it it was ok Oct 01, Jun 11, Tom Naessens rated it really liked it. Find a copy in the library Finding libraries that hold this item Similar Items Related Subjects: 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 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.
Chet rated it really liked it Nov 23, Description For upper level courses on Automata. These online bookshops tneory us they have this item: She was also co-PI on two other grants while at UT: Hemanth rated it it was amazing Dec 25, Turing machines and undecidability.
Automata, Computability and Complexity: Theory and Applications by Elaine A. Rich
Please choose whether or not you want other users to be able to see on your profile that this library is a favorite of yours. There are no discussion topics on this book yet.
Solutions to most of the problems in the book as well as teaching tips, adn complete set of lecture Power Point slides, additional exercises suitable for homework and exam questions. Flinders University Central Library.
For more information please go to to www. Allow this favorite library to be seen by others Keep this favorite library private. Saganaut rated it really liked it Mar 22, Skip to content Skip to search. Elaine Rich received her Ph.