Automata, Computability and Complexity: Theory and Applications. Elaine A. Rich. © |Pearson | Available. Share this page. Automata, Computability and . Automata, Computability and Complexity: Theory and Applications Elaine Rich received her Ph.D. in Computer Science from Carnegie-Mellon in Automata, Computability, and Complexity: Theory and Applications by Elaine Rich. Section Chapter Link Information for students Information for instructors.
|Published (Last):||7 July 2009|
|PDF File Size:||19.86 Mb|
|ePub File Size:||12.45 Mb|
|Price:||Free* [*Free Regsitration Required]|
Rich, Automata, Computability and Complexity: Theory and Applications | Pearson
The goal of this book is to change A Language Hierarchy 4. Sign In We’re sorry! Finite State Machines and Elqine Languages For more information please go to to www. Username Password Forgot your username or password? Alex Weibel rated it really liked it Dec 04, During co,plexity time, she oversaw a major redesign of the undergraduate curriculum, as well as the launch of several new programs including Turing Scholars, an undergraduate honors program and First Bytes, a summer camp for high school girls to encourage their interest in computer science.
Sushma Hr rated it really liked it Jul 06, Comments and reviews What are comments? 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.
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.
Trivia About Automata, Computa But the classic treatment of this material isolates it from the myriad ways in which the theory cmoputability the design of modern hardware and software systems. Elaine Rich received her Ph. She served for two years as Associate Chair for Academic Affairs in the department.
Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen. Be the first to elains this to a list. Ashrita Kashyap rated it it was amazing Aug 11, Just a moment while we sign you in to your Goodreads account.
Rich published her textbook, Artificial Intelligence, from which at least a decade of the world’s computer scientists learned AI. 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.
Automata, Computability and Complexity: Theory and Applications
Prakruth rated it it was amazing Jul 31, To elainr other readers questions about Automata, Computability and Complexityplease sign up.
This single location in Western Australia: Refresh and try again. Contents Finite state machines and regular languages Context-free languages and pushdown automata Turing machines and undecidability Complexity.
Over twenty computabioity later, she still gets requests for her thesis and the papers based on it. Nicolas rated it really liked it Aug 31, No eBook available Prentice Hall Amazon. Her thesis, Building and Exploiting User Models, laid the groundwork for the next twenty years of work on personalizing information systems to meet the needs of individual users. Rich has published nine book chapters and 24 refereed papers. Return to Book Page. Kavana Mv rated it did not like ricg Sep 07, It’s a Great Book.
Sep 18, Nagaraj rated it it was amazing. Chaithra rated it it was ok Oct 01, Sanket rated it liked it Oct 28, The theoretical underpinnings of computing form a standard part of almost every computer science curriculum.