Introduction to the Theory of Computation
Search in google:
This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.
PrefaceIntroduction1Pt. 1Automata and Languages291Regular Languages312Context-Free Languages91Pt. 2Computability Theory1233The Church-Turing Thesis1254Decidability1515Reducibility1716Advanced Topics in Computability Theory197Pt. 3Complexity Theory2237Time Complexity2258Space Complexity2779Intractability30510Advanced topics in complexity theory333Selected Bibliography381Index387
