Michael Sipser
Hardcover | Pages: 431 pages Rating: 4.22 | 1731 Users | 61 Reviews
Define Books To Introduction to the Theory of Computation
| Original Title: | Introduction to the Theory of Computation |
| ISBN: | 0534950973 (ISBN13: 9780534950972) |
| Edition Language: | English |
Chronicle Concering Books Introduction to the Theory of Computation
This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.
Itemize Out Of Books Introduction to the Theory of Computation
| Title | : | Introduction to the Theory of Computation |
| Author | : | Michael Sipser |
| Book Format | : | Hardcover |
| Book Edition | : | Second Edition |
| Pages | : | Pages: 431 pages |
| Published | : | February 1st 2005 by Course Technology (first published January 25th 1996) |
| Categories | : | Science. Computer Science. Programming. Textbooks. Mathematics. Reference. Nonfiction |
Rating Out Of Books Introduction to the Theory of Computation
Ratings: 4.22 From 1731 Users | 61 ReviewsArticle Out Of Books Introduction to the Theory of Computation
I bought this for class and it is important to understand that this text is meant to supplement lectures on the theory of computation. an excellent introduction for someone new to the field and subject!Anyone wishes to learn about automata, context-free languages, and Turing machines needs to pick up this book. I'm not even kidding. Sipser is such a clear writer and can describe concept things very lucidly. My favorite thing about this book compared to other mathematical books is that Sipser explicitly gives the "Proof Idea" before delving into a proof. Most people that use proofs are probably familiar with the sensation of finishing reading a proof only to wonder what in the world just
Insightful. A must read.
Great book for grads and theoreticians.
While I can't say that I have read another book on the same subject and thus can't rate the book comparatively, I can say beware to anyone picking up this book that likes to see practicality and don't have a big interest in this form of mathematical theory. For those in Computer Science, the only explanation about why you should be concerned is a one page of the preface at the beginning. And at least for the first two parts of the book, it includes very few examples and questions that seem to
I wish I could go back in time and give my past self this book, I encourage anyone interested in pursuing a degree in Computer Science to read chapter 0, it will show you the kinds of things that will be expected of you and prepare you for the math you'll need to learn. The later chapters are excellent for Automata Theory for those interested, and earlier editions like this are fairly cheap. The language makes the concepts easy to understand, and although the later chapters get a little wordy,
0 Comments:
Post a Comment
Note: Only a member of this blog may post a comment.