Elements of the theory of computation
Author(s)
Bibliographic Information
Elements of the theory of computation
Prentice-Hall, c1998
2nd ed
- : [pbk.]
Available at / 11 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
- Volume
-
ISBN 9780132624787
Description
Appropriate for senior and graduate level courses in Computer Science Theory, Automata, and Theory of Computation. This is the long awaited Second Edition of Lewis and Papadimitriou's best-selling theory of computation text. In this substantially modified edition, the authors have enhanced the clarity of their presentation by making the material more accessible to a broader undergraduate audience with no special mathematical experience.
Table of Contents
1. Sets, Relations, and Languages.
2. Finite Automata.
3. Context-free Languages.
4. Turing Machines.
5. Undecidability.
6. Computational Complexity.
7. NP-completeness.
Index.
- Volume
-
: [pbk.] ISBN 9780132727419
Description
Appropriate for senior and graduate level courses in Computer Science Theory, Automata, and Theory of Computation.
This is the long awaited Second Edition of Lewis and Papadimitriou's best-selling theory of computation text. In this substantially modified edition, the authors have enhanced the clarity of their presentation by making the material more accessible to a broader undergraduate audience with no special mathematical experience.
Table of Contents
1. Sets, Relations, and Languages.
2. Finite Automata.
3. Context-free Languages.
4. Turing Machines.
5. Undecidability.
6. Computational Complexity.
7. NP-completeness.
Index.
by "Nielsen BookData"
