Computation and automata
著者
書誌事項
Computation and automata
（Encyclopedia of mathematics and its applications / edited by G.-C. Rota, v. 25）
Cambridge University Press, 2011
- : pbk
注記
"First published 1985. First paperback edition 2011"--T.p. verso
Includes bibliographical references (p. 269-277) and index
内容説明・目次
内容説明
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.
目次
- 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
「Nielsen BookData」 より