This site uses cookies to deliver our services, improve performance, for analytics, and (if not signed in) for advertising. By using LibraryThing you acknowledge that you have read and understand our Terms of Service and Privacy Policy. Your use of the site and services is subject to these policies and terms.

Click on a thumbnail to go to Google Books.

Loading... ## Introduction to the Theory of Computation## by Michael Sipser
Loading...
Sign up for LibraryThing to find out whether you'll like this book. No current Talk conversations about this book. first glance: 2022-02-21---2022-02-27 ( ) Sipser starts from a treatment of basic set theory and proofs. He moves from there through regular languages & finite automata, context-free languages & pushdown automata, and on to Turing machines & the associated complexity theory (that P and NP jazz), and more. He thus builds a rigorous and pretty complete theory of computation course from the ground up, accessible to any determined reader with a little aptitude for finite math. The end of each chapter features dozens of general "exercises" and more rigorous "problems". Answers are provided for a few. When an exercise or problem makes reference to the chapter text, it's always easy to locate, as "figures", "theorems", "definitions", and so on are counted in the same series -- e.g. Figure 1.4 is found just before Definition 1.5. It's a small but refreshing design choice, one of many nice design choices in this beautiful volume. The new edition is quite expensive indeed, especially considering how small the book is. The new content since the second edition consists of some corrections and minor changes, and a new section on deterministic context-free languages. If you are buying this book for a course that won't cover deterministic CFL's -- a very challenging topic -- you might ask your instructor for permission to use the second edition. The new material does have some relevance to compilers, though, so you might like to have it handy if you plan to study compilers later. This book is a real gem. A coherent focus is maintained throughout, subjects are introduced in a rational order, and not a word or paragraph is wasted. The assignments at the end of the chapter are excellently selected to enhance understanding or to encourage investigation of topics which the book does not cover. no reviews | add a review
References to this work on external resources. ## Wikipedia in English (21)Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this revision continues the book's well-know, approachable style with timely revisions, additional practice, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. You gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E's comprehensive coverage makes this a valuable reference for your continued studies in theoretical computing. No library descriptions found. |
## Current DiscussionsNone## Popular covers
Google Books — Loading... ## Genres## Melvil Decimal System (DDC)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logic## LC Classification## RatingAverage:
## Is this you?Become a LibraryThing Author. |