Theory of Computation

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 that students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter. Features: * Revised for currency with updated examples and end-of-chapterexercises that review definitions, concepts, and problems tochallenge and extend students? understanding * Covers the foundations of theoretical computing designed aroundtheorems and proofs * Includes ?Worked Out Examples? throughout the text that maketopics conducive to students? learning * Uses a student-friendly approach to teach computer theory About The Author: Michael SipserAssociate Professor,Duquesne University Table Of Contents: "* Introduction * Part I: Automata and Languages 1. Regular Languages 2. Context-Free Languages * Part II: Computability Theory 3. The Church-Turing Thesis 4. Decidability 5. Reducibility 6. Advanced Topics in Computability Theory * Part III: Complexity Theory 7. Time Complexity 8. Space Complexity 9. Intractability 10. Advanced

Disclaimer:

• Theory of Computation book is not for reading online or for free download in PDF or eBook format.
• Table of Contents, Index, Syllabus, summary and image of Theory of Computation may be of a different edition or of the same title.
• Price can change due to reprinting, price change by publisher or sourcing cost change for imported books.