Introduction to the Theory of Computation (Paperback)

Michael Sipser

ISBN 10: 0357670582 / ISBN 13: 9780357670583

Verlag: Cengage Learning, Inc, Boston, MA, 2021

Beschreibung

Paperback. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Bestandsnummer des Verkäufers 9780357670583

Bibliografische Details

• Titel: Introduction to the Theory of Computation (Paperback)
• Verlag: Cengage Learning, Inc, Boston, MA
• Erscheinungsjahr: 2021
• Sprache: Englisch
• ISBN-10: 0357670582
• ISBN-13: 9780357670583
• Einband: Paperback
• Auflage: 3. Auflage
• Zustand: new

Über diesen Titel

Inhaltsangabe

Third Edition

Born in the latter part of the 20th century from the marriage of mathematics and technology, the theory of computation is now 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.

Über die Autorin bzw. den Autor

Michael Sipser has taught theoretical computer science and mathematics at the Massachusetts Institute of Technology for the past 32 years. He is a Professor of Applied Mathematics, a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL), and the current head of the mathematics department. He enjoys teaching and pondering the many mysteries of complexity theory.