Product Description & Reviews
This book presents automata theory, formal languages, and 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.
Features & Highlights
- Formal languages
- Computer science
- Models of computation
- Mathematical arguments
- Computational complexity
|Manufacturer:||Addison-Wesley Publishing Company|
|Brand:||Addison Wesley Publishing Company|
|Publisher:||Addison-Wesley Publishing Company|
|Studio:||Addison-Wesley Publishing Company|
|Item Size:||6.75 x 9.75 x 9.75 inches|
|Package Weight:||1.5 pounds|
|Package Size:||6.3 x 0.9 x 0.9 inches|
Have questions about this item, or would like to inquire about a custom or bulk order?
If you have any questions about this product, contact us by completing and submitting the form below. If you are looking for a specif part number, please include it with your message.
By Prentice Hall
ean: 9780131334069, isbn: 0131334069,
This book explains how to write C programs that manipulate digital signal processors (DSPs). The availability of faster signal processing components c...