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):||10 January 2016|
|PDF File Size:||14.61 Mb|
|ePub File Size:||5.97 Mb|
|Price:||Free* [*Free Regsitration Required]|
Account Options Sign in. There are no discussion topics on this book yet. Broad-ranging coverage allows instructors to easily customize course material to fit their an requirements.
Notes Includes bibliographical references and index. Anish rated it it was amazing Dec 25, The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. Signed out You have successfully signed out and will be required to sign back in should you need to download more resources. Over twenty years later, she still gets requests for her thesis and the papers based on it.
Rich joined the UT CS faculty in If you’re interested in creating a cost-saving package for your students, contact your Pearson rep.
Applicstions rating has been recorded. I can’t really fault this book for doing what everyone else does, but I felt I had to mention it. Check copyright status Cite this Title Automata, computability and complexity: Saganaut rated it really liked it Mar 22, She served for two years as Associate Chair for Academic Affairs in the department. Prakruth rated it it was amazing Jul 31, She was also co-PI on two other grants while at UT: However, formatting rules can vary widely between applications and fields of interest or study.
My library Help Advanced Book Search.
You also may like to try some of these bookshopswhich may or may not sell this item. Find a copy in the library Finding libraries that hold this item Allow this favorite library to be seen by others Keep this favorite library private. Automata, computability and complexity: At MCC, she was responsible for attracting and maintaining support, from MCC”s corporate shareholders, for the research projects in her lab. 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 automaha for high school girls to encourage their interest in computer science.
Remember me on this computer.
You have successfully signed out and will be required to sign back in should you need to download more resources. Automata, Computability and Complexity: Please verify that you are not a robot.
Pearson Prentice Hall, c In order to set up a list of libraries that you have access to, you must first login or sign autojata.
Linked Data More info about Linked Data. At MCC, she was responsible for attracting and maintaining support, from MCC’s corporate shareholders, for the research projects in her lab.
Description For upper level courses on Automata. Her thesis, Building and Exploiting User Models, laid the groundwork for the next twenty years of work on personalizing information systems to meet the theoyr of individual users.
A Language Hierarchy 4. For more information please go to to www. Prentice Hall- Computers – pages. View all subjects More like this Similar Items.
To ask other readers questions about Automata, Computability and Complexityplease sign up. This single location in South Australia: Hicham Elmongui rated it liked it Apr 30, The goal of this book is to change that.
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.
Rich published her elxine, Artificial Intelligence, from which at least a decade of the world”s computer scientists anx AI.