
Elements of the Theory of Computation
Pearson (Publisher)
2nd Edition
Published on 23. December 1997
Book
Paperback/Softback
384 pages
978-0-13-262478-7 (ISBN)
Description
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.
More details
Edition
2nd edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 230 mm
Width: 180 mm
Thickness: 2 mm
Weight
611 gr
ISBN-13
978-0-13-262478-7 (9780132624787)
Schweitzer Classification
Other editions
Previous edition
Book
02/1998
2nd Edition
Pearson Education (US)
€33.37
Article exhausted; check different version
Content
1. Sets, Relations, and Languages.
2. Finite Automata.
3. Context-free Languages.
4. Turing Machines.
5. Undecidability.
6. Computational Complexity.
7. NP-completeness.
Index.
2. Finite Automata.
3. Context-free Languages.
4. Turing Machines.
5. Undecidability.
6. Computational Complexity.
7. NP-completeness.
Index.