Computation and Automata

Erscheinungsjahr 2003
ISBN: 978-0-521-30245-6
Verlag: Cambridge University Press

Buch, Englisch, Band 25, 304 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 640 g

Reihe: Encyclopedia of Mathematics and its Applications

In this book, Professor 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. The presentation is essentially self-contained with detailed proofs of all statements provided, yet without sacrificing readability. Professor Salomaa is well known for his books in this area; the present work will be welcomed as an exposition that begins with basics familiar to advanced undergraduate students yet proceeds to some of the most important recent developments in theoretical computer science.

Autoren/Hrsg.

Salomaa, Arto

Rota, G. -C

Doran, B.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

Editor's statement; Foreword G. Rozenberg; Acknowledgments; 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; References; Index.