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):||1 October 2007|
|PDF File Size:||15.39 Mb|
|ePub File Size:||12.8 Mb|
|Price:||Free* [*Free Regsitration Required]|
No eBook available Prentice Hall Amazon.
Read, highlight, and take notes, across web, tablet, and phone. The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. 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 goal of this book is to change that. The book is organized into a core set of chapters that cover the standard material suggested by the titleconputability by a set of appendix chapters that highlight application areas including programming language design, compilers, software verification, networks, ajtomata, natural language processing, artificial intelligence, game playing, and computational biology.
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, elain 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.
complexiyy Throughout the discussion of these topics there are pointers into the application chapters. So, for example, the chapter that describes reduction proofs of undecidability has a link to the security chapter, which shows a reduction proof of the undecidability of the safety of a simple protection framework.
The explanation on this book are more detailed than other automata textbooks. The author also links the theoretical concepts with practical applications.
Automata, Computability and Complexity: Theory and Applications
Elaine Rich received her Ph. 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.
Over twenty years later, she still gets requests for her thesis and the papers based on it. Rich joined the UT CS faculty in She was also co-PI on two other grants while at UT: 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.
At MCC, she was responsible for attracting and maintaining support, from MCC”s corporate shareholders, for the research projects in her lab.
She served for two years as Associate Chair for Academic Affairs in the department.
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. Rich published her textbook, Artificial Intelligence, from which at least a decade of the world”s computer scientists learned AI. Inwith Kevin Knight, she published a second edition.
The two editions have sold overcopies.
Automata, Computability and Complexity: Theory and Applications by Elaine A. Rich
Rich has published nine book chapters and 24 refereed papers. Com;lexity Options Sign in. The goal of this book is to change My library Help Advanced Book Search. Automata, Computability and Complexity: Prentice Hall- Computers – pages. From inside the book.
User Review – Flag as inappropriate The explanation on this book are more detailed than other automata textbooks.