Introduction to the Theory of Computation

Front Cover
PWS Publishing Company, 1997 - Computers - 396 pages
20 Reviews
Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and the students will learn. His emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser - a noted authority on the theory of computation - builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own. INTRODUCTION TO THE THEORY OF COMPUTATION provides a mathematical treatment of computation theory grounded in theorems and proofs. Proofs are presented with a "proof idea" component to reveal the concepts underpinning the formalism. Algorithms are presented using prose instead of pseudocode to focus attention on the algorithms themselves, rather than on specific computational models. Topic coverage, terminology, and order of presentation are traditional for an upper-level course in computer science theory. Users of the Preliminary Edition (now out of print) will be interested to note several new chapters on complexity theory: Chapter 8 on space complexity; Chapter 9 on provable intractability, and Chapter 10 on advanced topics, including approximation algorithms, alternation, interactive proof systems, cryptography, and parallel computing.

From inside the book

What people are saying - Write a review

User ratings

5 stars
14
4 stars
6
3 stars
0
2 stars
0
1 star
0

Review: Introduction to the Theory of Computation

User Review  - Jeremy Frens - Goodreads

For some reason it feels strange to me to write a review for a textbook here at Goodreads, especially for a textbook I read and used years ago. But I love this book. While I was a college professor ... Read full review

Review: Introduction to the Theory of Computation

User Review  - Omesh - Goodreads

I like how the book is divided into three sections: Automata and Languages, Computability Theory and Complexity Theory. The book provides a good introduction to computability and complexity ... Read full review

Contents

Introduction IONvJ0JlJJvllI
1
Regular Languages
31
ContextFree Languages
91
Copyright

10 other sections not shown

Common terms and phrases

About the author (1997)

Michael Sipser is the head of the Mathematics Department. He enjoys teaching and pondering the many mysteries of complexity theory

Bibliographic information