Über dieses Produkt

Product Identifiers

PublisherCengage Learning Custom Publishing

ISBN-10113318779X

ISBN-139781133187790

eBay Product ID (ePID)16038636117

Product Key Features

Number of Pages504 Pages

LanguageEnglish

Publication NameIntroduction to the Theory of Computation

Publication Year2012

SubjectMachine Theory, Computer Science

FeaturesRevised

TypeTextbook

AuthorMichael Sipser

Subject AreaComputers

FormatHardcover

Dimensions

Item Height9.3 in

Item Weight27.2 Oz

Item Length1 in

Item Width6.5 in

Additional Product Features

Edition Number3

Intended AudienceCollege Audience

LCCN2012-938665

ReviewsThe text meets my objectives very well. The author presents the material in an appealing manner, making a hard subject accessible and intuitive to the students. He manages to do that while maintaining the rigor and formalism that the subject warrants. The book has a lot of information packed in it, and can serve as a reference book for students interested in research in theoretical CS., Excellent prose (simple and succinct) with very good diagrams. It is by far the best presentation of automata in the business.

Dewey Edition23

Dewey Decimal511.35

Table Of ContentIntroduction.PART 1: AUTOMATA AND LANGUAGES.1. Regular Languages.2. Context-Free Languages.PART 2: COMPUTABILITY THEORY.3. The Church-Turing Thesis.4. Decidability.5. Reducibility.6. Advanced Topics in Computability Theory.PART 3: COMPLEXITY THEORY.7. Time Complexity.8. Space Complexity.9. Intractability.10. Advanced Topics in Complexity Theory.Selected Bibliography.

Edition DescriptionRevised edition

SynopsisBorn in the latter part of the 20th century from the marriage of mathematics and technology, the theory of computation is how a major discipline permeating science and society. Michael Sipser's popular text gives a broad overview of this fascinating subject/starting from basic principles and covering many beautiful results and exciting unsolved questions. Sipser's approachable style allows students at every level to understand and enjoy this field. His innovative ôproof ideaö sections reveal the intuition underpinning the formal proofs of theorems by explaining profound concepts in plain English. The third edition includes an entirely new section on deterministic context-free languages with connections to parsing and LR(k) grammars. This lucid treatment of complex material illustrates how theoretical insights yield important applications in compiler design. In addition, the new edition-incorporates many improvements that readers have suggested and offers updated problem sets and solutions. Book jacket., 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.

LC Classification NumberQA