Introduction to the Theory of Computation

Author:   Michael Sipser (Massachusetts Institute of Technology)
Publisher:   Cengage Learning, Inc
Edition:   3rd edition
ISBN:  

9780357670583


Pages:   504
Publication Date:   29 January 2021
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $199.21 Quantity:  
Add to Cart

Share |

Introduction to the Theory of Computation


Add your own review!

Overview

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.

Full Product Details

Author:   Michael Sipser (Massachusetts Institute of Technology)
Publisher:   Cengage Learning, Inc
Imprint:   Course Technology Inc
Edition:   3rd edition
Dimensions:   Width: 16.00cm , Height: 23.10cm , Length: 2.20cm
Weight:   0.635kg
ISBN:  

9780357670583


ISBN 10:   0357670582
Pages:   504
Publication Date:   29 January 2021
Audience:   College/higher education ,  Tertiary & Higher Education
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Introduction. 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.

Reviews

Author Information

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.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

RGJUNE2025

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List