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.
Les mer
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
Les mer
In this 1985 book, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science.

Produktdetaljer

ISBN
9780521177337
Publisert
2011-04-28
Utgiver
Vendor
Cambridge University Press
Vekt
420 gr
Høyde
234 mm
Bredde
156 mm
Dybde
16 mm
Aldersnivå
P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
300

Forfatter