Książki

Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this revision continues the book's well-know, approachable style with timely revisions, additional practice, 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. You 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 a valuable reference for your continued studies in theoretical computing.

Introduction to the Theory of Computation

Introduction.

PART 1: AUTOMATA AND LANGUAGES.

1. Regular Languages.

2. Context-Free Languages.

PART 2: COMPUTABILITY THEORY.

3. The Church-Turing Thesis.

4. Decidability.

5. Reducibility.

6. Advanced Topics in Computability Theory.

PART 3: COMPLEXITY THEORY.

7. Time Complexity.

8. Space Complexity.

9. Intractability.

10. Advanced Topics in Complexity Theory.

Selected Bibliography.