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):||9 May 2006|
|PDF File Size:||19.36 Mb|
|ePub File Size:||10.53 Mb|
|Price:||Free* [*Free Regsitration Required]|
The two editions have sold overcopies.
Automata, Computability and Complexity: Theory and Applications by Elaine A. Rich
Automata, Computability and Complexity: You also may like to try some of these bookshopswhich may or may not sell this item. Jun 13, Pieter rated it really liked it Shelves: Thanks for telling us about the problem. For more information please go to to www. WorldCat is the world’s largest library catalog, helping you find library materials online. This single location in Western Australia: I can’t really fault this book for doing what everyone else does, but I felt I had to mention it.
Flinders University Central Library. Alex Weibel rated it really liked it Dec 04, 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.
Refresh and try again. Rich covers lots of complexity-related topics that Sipser barely mentions as well, so this book makes a great reference for basic complexity theory.
Companion Website for Automata, Computability and Complexity: Eich book is not yet featured on Listopia. However, formatting rules can vary widely between applications and fields of interest or study.
Sign Up Already have an access code?
Nicolas rated it really liked it Aug 31, Pretty good for a technical book about a very dry subject. Extensions and Alternative Definitions Prentice Hall wpplications, – Computers – pages.
Rich has published nine book chapters and 24 refereed papers.
C rated it really liked it Jul 08, 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.
Incomputabiloty Kevin Knight, she published a second edition.
Automata, Computability and Complexity: Theory and Applications
It’s a Great Book. The book is organized into a core set of chapters that cover the standard material suggested by the titlefollowed by a set of appendix chapters that highlight application areas including programming language design, compilers, software verification, ahtomata, security, natural language processing, artificial intelligence, game playing, and computational biology.
Rich, Automata, Computability and Complexity: Theory and Applications | Pearson
Mohammedmoin rated it really liked it Dec 12, Rich joined the UT CS faculty in To see what your friends thought of this book, please sign up. Would you also like to submit a review for this item? She served for two years as Associate Chair for Academic Affairs in the department. At MCC, she was responsible for attracting and maintaining support, from MCC’s corporate shareholders, for the research projects in her lab. Search WorldCat Find items in libraries near you.
From inside the book. Tags What are tags? Just a moment while we sign you in to your Goodreads account.