Automata, Computability and Complexity: Theory and Applications

Front Cover
Prentice Hall, 2008 - Computers - 1099 pages
5 Reviews

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 title), followed 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.

The core material includes discussions of finite state machines, Markov models, hidden Markov models (HMMs), regular 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. 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.

From inside the book

What people are saying - Write a review

User ratings

5 stars
4 stars
3 stars
2 stars
1 star

Review: Automata, Computability and Complexity: Theory and Applications

User Review  - Tom Naessens - Goodreads

Very good & readable book; lots of explanation which aren't too hard to understand or too trivial. Read full review

Review: Automata, Computability and Complexity: Theory and Applications

User Review  - Pieter De Baets - Goodreads

Pretty good for a technical book about a very dry subject. Read full review

Related books



45 other sections not shown

Common terms and phrases

References from web pages

Pearson - Automata, Computability and Complexity: Theory and ...
Automata, Computability and Complexity: Theory and Applications, Elaine A. Rich. ISBN-10: 0132288060 ISBN-13: 9780132288064. Publisher: Prentice Hall ... educator/ academic/ product/ 0,3110,0132288060,00.html

coursesmart - 9780135135662 - Automata, Computability and ...
9780135135662 - Automata, Computability and Complexity: Theory and Applications - Combining classic theory with unique applications, this crisp narrative is ... 9780135135662?tocview=true

Automata, Computability and Complexity: Theory & Applications
Automata, Computability, and Complexity: Theory and Applications by Elaine Rich. Section Chapter Link Information for students · Information for instructors ... ~ear/ cs341/ automatabook/

Bookpool: Automata Computability and Complexity,Theory and ...
Automata Computability and Complexity,Theory and Applications. View Larger Image · Elaine Rich Prentice Hall, Hardcover, Published September 2007, ... sm/ 0132288060

Automata, Computability and Complexity : Theory and Applications Save 50-90% off New & Used Books and Textbooks. Absolute lowest prices! Free Shipping. Fast Delivery search/ bookdetail/ ?isbn=9780132288064

Barnes & - Books: Automata, Computability and Complexity ...
Automata, Computability and Complexity: Theory and Applications, Rich, Elaine A. Rich, Hardcover, 1, Book, ISBN: 0132288060, Barnes & Automata-Computability-and-Complexity/ Elaine-A-Rich/ e/ 9780132288064

Libro - Elaine Rich - Automata, Computability and Complexity ...
Titolo: Automata, Computability and Complexity: Theory and Applications; Autore: Elaine Rich; Editore: Pearson Prentice Hall; Data di Pubblicazione: Agosto ... book_usa-automata_computability_and_complexity_theory-9780132288064.htm

【楽天市場】Automata, Computability and Complexity: Theory and ...
Automata, Computability and Complexity: Theory and Applications(Automata, Computability ... Automata, Computability and Complexity: Theory and Applications ... book/ 4948632/

Algoritam Multimedia Bookshop
AUTOMATA, COMPUTABILITY AND COMPLEXITY: THEORY AND APPLICATIONS. ve a slika. autor: Elaine Rich izdavař: Prentice Hall barcode: 9780132288064 godina: 2007 ... ?m=3& p=proizvod& kat=440& id=118397

Automata, Computability and Complexity: Theory and Applications. Por Rich, Elaine A., ,. Precio: 112 USD Pasta Dura - 1120 Pginas (Agosto 2007) ... libroimpreso/ esp/ sist/ index.php?tipo=detalle& idbip=9780132288064& id=164168

About the author (2008)

Elaine Rich received her Ph.D. in Computer Science from Carnegie-Mellon in 1979. 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.

Dr. Rich joined the UT CS faculty in 1979. She continued her work in the area of human/machine interfaces, with a focus on the use of knowledge-based systems. She was PI on an NSF grant, "Individual Models in Computer Systems", $56,000, NSF, 1980, which supported that work. She was also co-PI on two other grants while at UT: "An Experimental Computing Facility to Support the Design and Analysis of Reliable, High Performance Computing Systems", with J. C. Browne, A. G. Dale, D. I. Good, and A. Silberschatz, $3,700,000, NSF, 1982 and "Support for an AI Laboratory", with G. Novak, R. Simmons, and V. Kumar, $1,300,000, Army Research Office, 1984. The $3.7M NSF grant is particularly significant. 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.

In 1985, Dr. Rich left UT for the Microelectronic and Computing Technology Corporation (MCC). She served first as a Member of the Technical Staff, then Associate Director of the Human Interface Lab, then Director of the Artificial Intelligence Lab. At MCC, she was responsible for attracting and maintaining support, from MCC's corporate shareholders, for the research projects in her lab. Dr. Rich was responsible for setting research agendas, for enabling technology transfer from MCC to the shareholder companies, and for managing the lab's annual budgets (between $1M and $3M per year).

In 1998, Dr. Rich returned to the CS department at UT Austin as a Senior Lecturer. She has taught Automata Theory, Artificial Intelligence, and Natural Language Processing. 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.

In 1983, Dr. Rich published her textbook, Artificial Intelligence, from which at least a decade of the world's computer scientists learned AI. The book was translated into Japanese, French, Spanish, German, Italian and Portugese. In 1991, with Kevin Knight, she published a second edition. The two editions have sold over 250,000 copies.

Dr. Rich has published nine book chapters and 24 refereed papers. She has served as Editor of AI Magazine and on the editorial boards of Artificial Intelligence Review, The Knowledge Engineering Review, User Modeling and User-Adapted Interaction, and Applied Intelligence. She has served on numerous review panels for NSF and on the Discipline Advisory Committee of the Council of International Exchange of Scholars. In 1991, she was elected a Fellow of the American Association for Artificial Intelligence.

Bibliographic information