Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact email@example.com providing details of the course you are teaching.
This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: April 2011
- format: Paperback
- isbn: 9780521177337
- length: 300 pages
- dimensions: 234 x 156 x 16 mm
- weight: 0.42kg
- availability: Available
Table of Contents
Foreword G. Rozenberg
1. Introduction: models of computation
2. Rudiments of language theory
3. Restricted automata
4. Turing machines and recursive functions
5. Famous decision problems
6. Computational complexity
8. Trends in automata and language theory
Historical and bibliographical remarks
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×