HemGrupperDiskuteraMerTidsandan
Känner du till SantaThing, LibraryThings julklappsbyte?
avfärda
Denna webbplats använder kakor för att fungera optimalt, analysera användarbeteende och för att visa reklam (om du inte är inloggad). Genom att använda LibraryThing intygar du att du har läst och förstått våra Regler och integritetspolicy. All användning av denna webbplats lyder under dessa regler.
Hide this

Resultat från Google Book Search

Klicka på en bild för att gå till Google Book Search.

Introduction to the Theory of Computation av…
Laddar...

Introduction to the Theory of Computation (utgåvan 2006)

av Michael Sipser (Författare)

MedlemmarRecensionerPopularitetGenomsnittligt betygDiskussioner
667525,098 (3.99)Ingen/inga
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.… (mer)
Medlem:huntnb
Titel:Introduction to the Theory of Computation
Författare:Michael Sipser (Författare)
Info:Course Technology (2006), Edition: 2nd, 431 pages
Samlingar:Ditt bibliotek
Betyg:
Taggar:Ingen/inga

Verkdetaljer

Introduction to the Theory of Computation av Michael Sipser

Senast inlagd avDawnDrain, privat bibliotek, michelleqcy, jockoflocko, jackcrawford, meklibraries, xphileprof

Ingen/inga.

Ingen/inga
Laddar...

Gå med i LibraryThing för att få reda på om du skulle tycka om den här boken.

Det finns inga diskussioner på LibraryThing om den här boken.

Visar 5 av 5
I read this for a class in the Theory of Computation. The book was very clear and as easy to read as any other theoretical math textbook. ( )
  sbloom42 | May 21, 2014 |
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.
  Tammmer | Dec 7, 2013 |
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. ( )
  themulhern | Dec 6, 2011 |
This is quite possibly one of the most terse, clearly-written CS theory books that there is. ( )
  mlcastle | Apr 8, 2007 |
This was one of the better textbooks I had to use, in terms of aesthetics, design, layout, and materials, but I was always frustrated by its use of animistic metaphor for rigorous algorithmic processes -- a Turing machine no more "wants" or "expects" something than a rock does. At the same time, the examples were usually more illuminating than in other texts, so I can't complain too much. ( )
  calebmb | Jun 2, 2006 |
Visar 5 av 5
inga recensioner | lägg till en recension
Du måste logga in för att ändra Allmänna fakta.
Mer hjälp finns på hjälpsidan för Allmänna fakta.
Vedertagen titel
Information från den engelska sidan med allmänna fakta. Redigera om du vill anpassa till ditt språk.
Originaltitel
Alternativa titlar
Första utgivningsdatum
Personer/gestalter
Viktiga platser
Viktiga händelser
Relaterade filmer
Priser och utmärkelser
Motto
Dedikation
Inledande ord
Citat
Avslutande ord
Särskiljningsnotis
Förlagets redaktörer
På baksidan citeras
Ursprungsspråk
Kanonisk DDC/MDS
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.

Inga biblioteksbeskrivningar kunde hittas.

Bokbeskrivning
Haiku-sammanfattning

Snabblänkar

Populära omslag

Betyg

Medelbetyg: (3.99)
0.5
1 1
1.5 1
2 2
2.5
3 15
3.5 1
4 24
4.5 1
5 24

Är det här du?

Bli LibraryThing-författare.

 

Om | Kontakt | LibraryThing.com | Sekretess/Villkor | Hjälp/Vanliga frågor | Blogg | Butik | APIs | TinyCat | Efterlämnade bibliotek | Förhandsrecensenter | Allmänna fakta | 152,741,248 böcker! | Topplisten: Alltid synlig