Elements of the theory of computation / Harry R. Lewis, Christos H. Papadimitriou.
Material type:
TextPublication details: Upper Saddle River, N.J. : Prentice-Hall, c1998.Edition: 2nd edDescription: 361 p. : ill. ; 25 cmISBN: - 0132624788
- QA267 .L49 1998
| Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
| Books | Library First Floor | QA267 .L49 1998 (Browse shelf(Opens below)) | 1 | Available | 3290 |
Includes bibliographical references and index.
1. Sets, Relations, and Languages. 2. Finite Automata. 3. Context-free Languages. 4. Turing Machines. 5. Undecidability. 6. Computational Complexity. 7. NP-completeness. Index.
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.
There are no comments on this title.