Cargando…
Computation and automata /
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 readab...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge [Cambridgeshire] ; New York :
Cambridge University Press,
1985.
|
| Colección: | Encyclopedia of mathematics and its applications ;
v. 25. |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn852898533 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130716s1985 enka ob 001 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d CAMBR |d IDEBK |d E7B |d OCLCF |d YDXCP |d OCLCQ |d AGLDB |d YDX |d OCLCO |d OCLCQ |d COO |d VTS |d STF |d AU@ |d OCLCO |d M8D |d UKAHL |d OCLCQ |d K6U |d SFB |d OCLCQ |d OCLCO |d OCLCQ | ||
| 019 | |a 841396523 |a 985178458 |a 985402424 |a 1020562166 | ||
| 020 | |a 9781107087583 |q (electronic bk.) | ||
| 020 | |a 1107087589 |q (electronic bk.) | ||
| 020 | |a 9781107325630 |q (electronic bk.) | ||
| 020 | |a 1107325633 |q (electronic bk.) | ||
| 020 | |z 0521302455 | ||
| 020 | |z 9780521302456 | ||
| 020 | |z 9780521177337 |q (paperback) | ||
| 029 | 1 | |a DEBBG |b BV043059565 | |
| 029 | 1 | |a DEBSZ |b 446489999 | |
| 035 | |a (OCoLC)852898533 |z (OCoLC)841396523 |z (OCoLC)985178458 |z (OCoLC)985402424 |z (OCoLC)1020562166 | ||
| 050 | 4 | |a QA9.59 |b .S25 1985eb | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511 |2 22 |
| 084 | |a 31.80 |2 bcl | ||
| 084 | |a 31.10 |2 bcl | ||
| 084 | |a 31.12 |2 bcl | ||
| 049 | |a UAMI | ||
| 100 | 1 | |a Salomaa, Arto. | |
| 245 | 1 | 0 | |a Computation and automata / |c Arto Salomaa. |
| 260 | |a Cambridge [Cambridgeshire] ; |a New York : |b Cambridge University Press, |c 1985. | ||
| 300 | |a 1 online resource (xiii, 284 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Encyclopedia of mathematics and its applications ; |v v. 25 | |
| 504 | |a Includes bibliographical references (pages 269-277) and index. | ||
| 588 | 0 | |a Print version record. | |
| 520 | |a 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. | ||
| 505 | 0 | |a 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 | |
| 505 | 8 | |a 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 | |
| 505 | 8 | |a 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 | |
| 505 | 8 | |a 8.2. SIMILAR GRAMMARS AND LANGUAGES8.3. SYSTOLIC AUTOMATA; EXERCISES; Historical and Bibliographical Remarks; References; Index | |
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Computable functions. | |
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Sequential machine theory. | |
| 650 | 6 | |a Fonctions calculables. | |
| 650 | 6 | |a Complexité de calcul (Informatique) | |
| 650 | 6 | |a Théorie des machines séquentielles. | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Computable functions. |2 fast |0 (OCoLC)fst00871985 | |
| 650 | 7 | |a Computational complexity. |2 fast |0 (OCoLC)fst00871991 | |
| 650 | 7 | |a Sequential machine theory. |2 fast |0 (OCoLC)fst01112895 | |
| 650 | 7 | |a Formale Sprache |2 gnd | |
| 650 | 7 | |a Automatentheorie |2 gnd | |
| 650 | 7 | |a Komplexitätstheorie |2 gnd | |
| 650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
| 650 | 7 | |a Automates mathématiques, Théorie des. |2 ram | |
| 650 | 7 | |a Machines séquentielles, Théorie des. |2 ram | |
| 776 | 0 | 8 | |i Print version: |a Salomaa, Arto. |t Computation and automata. |d Cambridge [Cambridgeshire] ; New York : Cambridge University Press, 1985 |z 0521302455 |w (DLC) 84017571 |w (OCoLC)11089329 |
| 830 | 0 | |a Encyclopedia of mathematics and its applications ; |v v. 25. | |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=570392 |z Texto completo |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH25052471 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH26478639 | ||
| 938 | |a ebrary |b EBRY |n ebr10733628 | ||
| 938 | |a EBSCOhost |b EBSC |n 570392 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis25836231 | ||
| 938 | |a YBP Library Services |b YANK |n 10440785 | ||
| 938 | |a YBP Library Services |b YANK |n 10862011 | ||
| 994 | |a 92 |b IZTAP | ||