Introduction to the Theory of Computation, Second Edition by Michael Sipser  (51)
$112.76
|
Introduction to Algorithms by Thomas H. Cormen  (167)
$61.88
|
Artificial Intelligence: A Modern Approach (2nd Edition) (Prentice Hall Series in Artificial Intelligence) by Stuart Russell (78)
$96.00
|
Compilers: Principles, Techniques, and Tools (2nd Edition) by Alfred V. Aho (67)
$106.00
|
Operating System Concepts (7th Edition) by Abraham Silberschatz (16)
$89.36
|
This item is not eligible for Amazon Prime, but millions of other items are. Join Amazon Prime today. Already a member? Sign in.
|
|||||||||||||
Customers Who Bought This Item Also Bought
Editorial Reviews
Amazon.com
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
From the Back Cover
computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars. 020102988XB04062001
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
From the Back Cover
computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars. 020102988XB04062001
Product Details
Would you like to update product info or give feedback on images?
|
See all 41 customer reviews...
Citations
(learn more)
100
books
cite this book:
- Developments in Language Theory: 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001. Revised Papers (Lecture Notes in Computer Science) by Werner Kuich on 9 pages
- Grammatical Inference: Algorithms and Applications by Pieter Adriaans on 6 pages
- Structure in Complexity Theory: Proceedings of the Conference held at the University of California, Berkeley, June 2-5, 1986 (Lecture Notes in Computer Science) by Alan L. Selman on 6 pages