TY  - BOOK
AU  - Lewis,Harry R.
TI  - Elements of the theory of computation
SN  - 0132624788
AV  - QA267 .L49 1998
PY  - 1998///
CY  - Upper Saddle River, N.J.
PB  - Prentice-Hall
KW  - Machine theory
KW  - Formal languages
KW  - Computational complexity
KW  - Logic, Symbolic and mathematical
N1  - 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
N2  - 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
ER  -