Introduction to the Theory of Computation

Front Cover
PWS Publishing Company, 1996 - Computational complexity - 239 pages
4 Reviews
Discusses such topics as: regular languages; context-free languages; Church-Turing thesis; decidability; reducibility; the recursion theorem; time complexity; space complexity; and provable intractability.

From inside the book

What people are saying - Write a review

LibraryThing Review

User Review  - themulhern - LibraryThing

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 ... Read full review

LibraryThing Review

User Review  - sbloom42 - LibraryThing

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. Read full review

Contents

Automata and Languages
29
ContextFree Languages
81
Computability Theory
111
Copyright

5 other sections not shown

Other editions - View all

Common terms and phrases

About the author (1996)

Michael Sipser has taught theoretical computer science and other mathematical subjects at the Massachusetts Institute of Technology for the past 25 years, where he is a professor of Applied Mathematics and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL). Currently, he is the head of the mathematics department. He enjoys teaching and pondering the many mysteries of complexity theory.

Bibliographic information