Elements of the theory of computation /
Lewis, Harry R.
Elements of the theory of computation / Harry R. Lewis, Christos H. Papadimitriou. - 2nd ed. - Upper Saddle River, N.J. : Prentice-Hall, c1998. - 361 p. : ill. ; 25 cm.
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.
0132624788
Machine theory.
Formal languages.
Computational complexity.
Logic, Symbolic and mathematical.
QA267 / .L49 1998
Elements of the theory of computation / Harry R. Lewis, Christos H. Papadimitriou. - 2nd ed. - Upper Saddle River, N.J. : Prentice-Hall, c1998. - 361 p. : ill. ; 25 cm.
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.
0132624788
Machine theory.
Formal languages.
Computational complexity.
Logic, Symbolic and mathematical.
QA267 / .L49 1998