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.
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Maße
Höhe: 234 mm
Breite: 181 mm
Dicke: 18 mm
Gewicht
ISBN-13
978-0-13-272741-9 (9780132727419)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
1. Sets, Relations, and Languages.
2. Finite Automata.
3. Context-free Languages.
4. Turing Machines.
5. Undecidability.
6. Computational Complexity.
7. NP-completeness.
Index.
