Introduction to the Theory of Computation

Voorkant
Cengage Learning, 27 jun. 2012 - 504 pagina's
5 Recensies
Now you can clearly present even the most complex computational theory topics to your students with Sipser's distinct, market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this highly anticipated revision retains the unmatched clarity and thorough coverage that make it a leading text for upper-level undergraduate and introductory graduate students. This edition continues author Michael Sipser's well-known, approachable style with timely revisions, additional exercises, 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. This edition's refined presentation ensures a trusted accuracy and clarity that make the challenging study of computational theory accessible and intuitive to students while maintaining the subject's rigor and formalism. Readers 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 an ideal ongoing reference tool for those studying theoretical computing.
Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.
 

Wat mensen zeggen - Een review schrijven

Gebruikersbeoordelingen

5 sterren
1
4 sterren
2
3 sterren
0
2 sterren
1
1 ster
1

LibraryThing Review

Gebruikersrecensie  - Tammmer - LibraryThing

Sipser starts from a treatment of basic set theory and proofs. He moves from there through regular languages & finite automata, context-free languages & pushdown automata, and on to Turing machines ... Volledige review lezen

LibraryThing Review

Gebruikersrecensie  - 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 ... Volledige review lezen

Inhoudsopgave

Introduction
1
Automata and Languages
29
Computability Theory
163
Complexity Theory
273

Overige edities - Alles weergeven

Veelvoorkomende woorden en zinsdelen

Over de auteur (2012)

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.

Bibliografische gegevens