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.·~ • · Elaine Rich Automata, Computability and Complexity THEORY AND APPLIC.

Author: Gak Arale
Country: Nigeria
Language: English (Spanish)
Genre: Art
Published (Last): 7 December 2010
Pages: 475
PDF File Size: 3.41 Mb
ePub File Size: 12.36 Mb
ISBN: 578-8-46298-974-3
Downloads: 68602
Price: Free* [*Free Regsitration Required]
Uploader: Nakus

Trivia About Automata, Computa 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. Pearson Prentice Hall, c Websites and computzbility courses.

Automata, computability and complexity: Combining classic theory with unique applications, this crisp narrative is supported by abundant compoexity and clarifies key concepts by introducing important uses of techniques in real systems.

We don’t recognize your username or password.

Sign Up Already have an access code? She served for two years as Associate Chair for Academic Affairs in the department.

Automata, Computability and Complexity: Theory and Applications

Companion Website for Automata, Computability and Complexity: Lists What are lists? Rich published her textbook, Artificial Intelligence, from which at least a decade of the world’s computer scientists learned AI.

Aug 24, Rod Hilton rated it automta was amazing Shelves: Want to Read Currently Reading Read. Finite State Machines and Regular Languages If You’re a Student Buy this product Additional order info.

Bilal Rafique rated it it was amazing Aug 18, The work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning. This single location in South Australia: During that 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 compjtability girls to encourage their interest in computer science.


At MCC, she was responsible for attracting and maintaining support, from MCC’s corporate shareholders, for the research projects in her lab.

Anish rated it it was amazing Dec 25, 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. Theory and Applications by Elaine A. 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.

Rich has published nine book chapters and 24 refereed papers. 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.


Automata, Computability and Complexity: Theory and Applications by Elaine A. Rich

Want to Read saving…. Lists with This Book. If you’re interested in creating a cost-saving package for your students, contact your Pearson rep.

Sanket rated it liked it Oct 28, It supported, for the first time in our department’s history, a significant investment in the computing and networking infrastructure required to enable research groups to cooperate in work that required building large software systems.

There are no discussion topics on this book yet. The theoretical underpinnings of computing form a standard part of almost every computer science curriculum.

Manoj Kumar rated it it was amazing Aug 08, Language English View all editions Prev Next edition 1 of 2. May 21, Nick Luchsinger rated it it was amazing Shelves: Contents Finite state machines and regular languages Context-free languages and pushdown automata Turing machines and undecidability Complexity. She was also co-PI on two other grants complexiy at UT: Login to add to list.

Description For upper level courses on Automata.