Computation and automata

著者

• Salomaa, Arto

書誌事項

Computation and automata

Arto Salomaa

（Encyclopedia of mathematics and its applications / edited by G.-C. Rota, v. 25）

Cambridge University Press, 1985

注記

Pagination of 2003 printig: xiii, 284 p

Bibliography: p. 269-277

Includes 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」 より

詳細情報

• NII書誌ID(NCID): BA00126421
• ISBN:
  • 0521302455
• LCCN: 84017571
• 出版国コード: uk
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: Cambridge [Cambridgeshire]
• ページ数/冊数: xiii, 282 p.
• 大きさ: 24 cm
• 分類:
  • LCC : QA9.59
  • DC19 : 511
• 件名:
  • LCSH : Computable functions
  • LCSH : Computational complexity
  • LCSH : Sequential machine theory
• 親書誌ID:
  • BA00064663