| Description |
1 online resource (xiii, 284 pages) : illustrations |
| Series |
Encyclopedia of mathematics and its applications ; v. 25 |
|
Encyclopedia of mathematics and its applications ; v. 25.
|
| Contents |
Cover; Half Title; Series Page; Title; Copyright; Contents; Editor's Statement; Foreword; Acknowledgments; Chapter 1 Introduction: Models of Computation; Chapter 2 Rudiments of Language Theory; 2.1. LANGUAGES AND REWRITING SYSTEMS; 2.2. GRAMMARS; 2.3. POST SYSTEMS; 2.4. MARKOV ALGORITHMS; 2.5. L SYSTEMS; EXERCISES; Chapter 3 Restricted Automata; 3.1. FINITE AUTOMATA; 3.2. KLEENE CHARACTERIZATION; 3.3. GENERALIZED SEQUENTIAL MACHINES; 3.4. PUMPING LEMMAS; 3.5. PUSHDOWN AUTOMATA; EXERCISES; Chapter 4 Turing Machines and Recursive Functions; 4.1. A GENERAL MODEL OF COMPUTATION |
|
4.2. PROGRAMMING IN MACHINE LANGUAGE, CHURCH'S THESIS, AND UNIVERSAL MACHINES4.3. RECURSION THEOREM AND BASIC UNDECIDABILITY RESULTS; 4.4. RECURSIVE AND RECURSIVELY ENUMERABLE SETS AND LANGUAGES; 4.5. REDUCIBILITIES AND CREATIVE SETS; 4.6. UNIVERSALITY IN TERMS OF COMPOSITION; EXERCISES; Chapter 5 Famous Decision Problems; 5.1. POST CORRESPONDENCE PROBLEM AND APPLICATIONS; 5.2. HILBERT'S TENTH PROBLEM AND CONSEQUENCES: MOST QUESTIONS CAN BE EXPRESSED IN TERMS OF POLYNOMIALS; 5.3. WORD PROBLEMS AND VECTOR ADDITION SYSTEMS; EXERCISES; Chapter 6 Computational Complexity |
|
6.1. BASIC IDEAS AND AXIOMATIC THEORY6.2. COMPLEXITY CLASSES, GAP, AND COMPRESSION THEOREMS; 6.3. SPEEDUP THEOREM: FUNCTIONS WITHOUT BEST ALGORITHMS; 6.4. TIME BOUNDS, THE CLASSES CP AND MCP, AND MCP-COMPLETE PROBLEMS; 6.5. PROVABLY INTRACTABLE PROBLEMS; 6.6. SPACE MEASURES AND TRADE-OFFS; EXERCISES; Chapter 7 Cryptography; 7.1. BACKGROUND AND CLASSICAL CRYPTOSYSTEMS; 7.2. PUBLIC KEY CRYPTOSYSTEMS; 7.3. KNAPSACK SYSTEMS; 7.4. RSA SYSTEM; 7.5. PROTOCOLS FOR SOLVING SEEMINGLY IMPOSSIBLE PROBLEMS IN COMMUNICATION; EXERCISES; Chapter 8 Trends in Automata and Language Theory; 8.1. PETRI NETS |
|
8.2. SIMILAR GRAMMARS AND LANGUAGES8.3. SYSTOLIC AUTOMATA; EXERCISES; Historical and Bibliographical Remarks; References; Index |
| Summary |
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 |
| Bibliography |
Includes bibliographical references (pages 269-277) and index |
| Notes |
Print version record |
| Subject |
Computable functions.
|
|
Computational complexity.
|
|
Sequential machine theory.
|
|
MATHEMATICS -- General.
|
|
Computable functions
|
|
Computational complexity
|
|
Sequential machine theory
|
|
Formale Sprache
|
|
Automatentheorie
|
|
Komplexitätstheorie
|
|
Complexité de calcul (informatique)
|
|
Automates mathématiques, Théorie des.
|
|
Machines séquentielles, Théorie des.
|
| Form |
Electronic book
|
| ISBN |
9781107087583 |
|
1107087589 |
|
9781107325630 |
|
1107325633 |
|
