Image from Google Jackets

Elements of the theory of computation / Harry R. Lewis, Christos H. Papadimitriou.

By: Material type: TextTextPublication details: Upper Saddle River, N.J. : Prentice-Hall, c1998.Edition: 2nd edDescription: 361 p. : ill. ; 25 cmISBN:
  • 0132624788
Subject(s): LOC classification:
  • QA267 .L49 1998
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.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)

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.

to post a comment.
New Arrivals

Loading...

Contact Us

Library: Location maps

Phone: 00968 2323 7091 Email: Ask us a question

Library Hours

Sunday - Thursday 7:30AM - 8:00 PM

Friday - Saturday Closed