Computation and Automata (häftad)
Fler böcker inom
Format
Häftad (Paperback)
Språk
Engelska
Antal sidor
300
Utgivningsdatum
2011-04-28
Förlag
Cambridge University Press
Medarbetare
Salomaa
Illustrationer
black & white illustrations
Volymtitel
Series Number 25 Computation and Automata
Dimensioner
234 x 156 x 16 mm
Vikt
439 g
Antal komponenter
1
Komponenter
49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam
ISBN
9780521177337
Computation and Automata (häftad)

Computation and Automata

Häftad Engelska, 2011-04-28
589
Skickas inom 10-15 vardagar.
Fri frakt inom Sverige för privatpersoner.
Finns även som
Visa alla 2 format & utgåvor
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.
Visa hela texten

Passar bra ihop

  1. Computation and Automata
  2. +
  3. Public-Key Cryptography

De som köpt den här boken har ofta också köpt Public-Key Cryptography av Arto Salomaa (häftad).

Köp båda 2 för 1818 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Bloggat om Computation and Automata

Innehållsförteckning

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