Elements Of The Theory Of Computatio 2nd Edition

Lewis and Papadimitriou present this long awaited Second Edition of their best-selling theory of computation. The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.

1. Sets, Relations, and Languages.

2. Finite Automata.

3. Context-free Languages.

4. Turing Machines.

5. Undecidability.

6. Computational Complexity.

7. NP-completeness.

Index.