- Hardcover: 1120 pages
- Publisher: Pearson; 1 edition (September 28, 2007)
- Language: English
- ISBN-10: 0132288060
- ISBN-13: 978-0132288064
- Product Dimensions: 7.5 x 2.5 x 9.5 inches
- Shipping Weight: 3.8 pounds (View shipping rates and policies)
- Average Customer Review: 10 customer reviews
- Amazon Best Sellers Rank: #471,647 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Automata, Computability and Complexity: Theory and Applications 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
The Amazon Book Review
Author interviews, book reviews, editors picks, and more. Read it now
Frequently bought together
Customers who bought this item also bought
From the Back Cover
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.
About the Author
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.
Browse award-winning titles. See more
Top customer reviews
And to the person who complains about "Typ-Os" causing a loss of credibility" -really? It pretty much sounds like you just didn't get the material, friend. I wouldn't feel bad about that, as it's a difficult subject for all but the smart kids, but to then turn around and assign a verbally misshapen 1 star rating to an excellent book on the subject is a)something I'd personally equate to breaking a**crack etiquette in a busy cafeteria for embarrassment value, and b) a disservice to those of us struggling in a class that is a CS degree requirement that really need the life line that this book represents. Please fellow CS students, feel free to ignore the negative reviews of those who can't even name a models topic that they felt wasn't well-explained and get this book -it'll save ya!
maze of the mathematical symbolism, but that are otherwise not that difficult to grasp.
I have found her visual depictions of the problems very helpful, and I have specially liked how she connects theoretical computers science (e.g. halting, undecidability) with common software engineering tools and tasks such as compilers and programming languages.
Standard topics are covered as in other leading books in the field (Sipser, Hopcroft, Papadimitrou, ). The difference is that it seems that Dr. Rich has spent more time explaining and illustrating concepts (book is 1100 pages long). I still recommend other books as the primary sources as they are as complete as they are concise, but I also recommend
using this book if nothing as the supplementary learning aid.
This book helped me understand the problems required for my homeworks and exams, so, if for nothing else, I have to give it just for that fact five stars.
Also, it is not illegal to purchase International versions of textbooks in the United States. The textbook companies just want to rip you off. Be wary- sometimes international textbooks have slightly different page numbers or switched around chapters or slightly different exercises, but take my word for it-this book is exactly the same, at a fraction of the cost.
To be honest, most students will hate Automata Theory, and to those that do I offer that this book is probably your best (and least painful) chance at passing the course. For the few students find the material intriguing, perhaps even enjoyable, this book will open your eyes to Automata Theory and provide you with a strong foundational understanding of its concepts.
Another thing that bothers me is the blah blah blah. There seems to be a lot of unnecessary stuff. That needs to be cut down on. Takes forever to get through it. It just discourages the reader.