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.

Author: Meztiktilar Malamuro
Country: Malaysia
Language: English (Spanish)
Genre: Spiritual
Published (Last): 20 February 2009
Pages: 335
PDF File Size: 12.64 Mb
ePub File Size: 4.75 Mb
ISBN: 497-2-35916-674-1
Downloads: 47168
Price: Free* [*Free Regsitration Required]
Uploader: Samumuro

Chet rated it really liked it Nov 23, A Language Hierarchy 4.

Automata, Computability and Complexity: Theory and Applications

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, computbility algorithms and elaime search.

Login to add to list.

Feb 19, Wouter Pinnoo rated it it was amazing. Nicolas rated it really liked it Aug 31, Anish rated it it was amazing Dec 25, Over twenty years later, she still gets requests for her thesis and the papers based on it. The book is organized into a core set of chapters that cover the standard material suggested by the automattafollowed by a set of appendix chapters that highlight application areas including programming language design, compilers, clmputability verification, networks, security, natural language processing, artificial intelligence, game playing, and computational biology.

Notes Includes bibliographical references and index. Share a link to All Resources. If You’re a Student Buy this product Additional order info. Ashrita Kashyap rated it it was amazing Aug 11, She was also co-PI on two other grants while at UT: Kavana Mv rated it did not like it Sep 07, Rich has published nine book chapters and 24 refereed papers.


My library Help Advanced Book Search. 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. From inside the book. She was also co-PI on two other grants while at UT: Rich joined the UT CS faculty in We don’t recognize your username or password. 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 school girls to encourage their interest in computer science.

You have successfully signed out and will be required to sign back in should you need to download more resources. Be the first to ask a question about Automata, Computability and Complexity. Read, highlight, and take notes, across web, tablet, and phone. Rich published her textbook, Artificial Intelligence, from which at least a ccomputability of the world’s computer scientists learned AI.

Username Password Forgot your username or password? Theory and Applications by Elaine A. She served for two years as Associate Chair for Academic Affairs in the department. Bilal Rafique rated snd it was amazing Aug 18, It’s a Great Book.

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.

Gnanendra Hell Rider rated it really liked it Aug 15, Skip to content Skip to search.


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. Open to the public ; Open Preview See a Problem? Saganaut rated it really liked it Mar 22, Return to Book Page.

At MCC, she was responsible for attracting and maintaining support, from MCC”s corporate shareholders, for the research projects in her lab. The goal of this book is to change that. None of your libraries hold this item. Vinayaka rated it it was amazing Sep 29, Elaine Rich received her Ph.

Automata, Computability and Complexity: Theory & Applications

Tags What are tags? Description For upper level courses on Automata. Companion Website for Automata, Computability and Complexity: Mohammedmoin rated it really liked it Dec cmoputability, Hicham Elmongui rated it liked it Apr 30, Comments and reviews What are comments?

Pretty good for a technical book about a very dry subject. 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.

Solutions to most of amd problems in the book as well as teaching tips, a complete set of lecture Power Point slides, additional exercises suitable for homework and exam questions. A rated it liked it Mar 29, Throughout the discussion of these topics there are pointers into the application chapters.