Computation and Automata
Computation and Automata
Looking for an inspection copy?
This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact asiamktg@cambridge.org providing details of the course you are teaching.
In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field.
Product details
April 2011Paperback
9780521177337
300 pages
234 × 156 × 16 mm
0.42kg
Available
Table of Contents
- Editor's statement
- Foreword G. Rozenberg
- Acknowledgements
- 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
- 7. Cryptography
- 8. Trends in automata and language theory
- Historical and bibliographical remarks
