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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [Cambridgeshire] ; New York :
Cambridge University Press,
1985.
|
| Schriftenreihe: | Encyclopedia of mathematics and its applications ;
v. 25. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (xiii, 284 pages) : illustrations |
| Bibliographie: | Includes bibliographical references (pages 269-277) and index. |
| ISBN: | 9781107087583 1107087589 9781107325630 1107325633 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn852898533 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.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 |d OCLCO |d OCLCL |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) | ||
| 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 | 7 | |a 511 |2 22 | |
| 084 | |a 31.80 |2 bcl | ||
| 084 | |a 31.10 |2 bcl | ||
| 084 | |a 31.12 |2 bcl | ||
| 049 | |a MAIN | ||
| 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 | |
| 650 | 0 | |a Computable functions. |0 http://id.loc.gov/authorities/subjects/sh85029469 | |
| 650 | 0 | |a Computational complexity. |0 http://id.loc.gov/authorities/subjects/sh85029473 | |
| 650 | 0 | |a Sequential machine theory. |0 http://id.loc.gov/authorities/subjects/sh85120149 | |
| 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 | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Sequential machine theory |2 fast | |
| 650 | 7 | |a Formale Sprache |2 gnd |0 http://d-nb.info/gnd/4017848-1 | |
| 650 | 7 | |a Automatentheorie |2 gnd |0 http://d-nb.info/gnd/4003953-5 | |
| 650 | 7 | |a Komplexitätstheorie |2 gnd |0 http://d-nb.info/gnd/4120591-1 | |
| 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 | |
| 758 | |i has work: |a Computation and automata (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFWf9T9y4D6FVBp8qdprjd |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 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. |0 http://id.loc.gov/authorities/names/n42010632 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=570392 |3 Volltext |
| 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 GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn852898533 |
|---|---|
| _version_ | 1816882238519771136 |
| adam_text | |
| any_adam_object | |
| author | Salomaa, Arto |
| author_facet | Salomaa, Arto |
| author_role | |
| author_sort | Salomaa, Arto |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA9 |
| callnumber-raw | QA9.59 .S25 1985eb |
| callnumber-search | QA9.59 .S25 1985eb |
| callnumber-sort | QA 19.59 S25 41985EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| 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 |
| ctrlnum | (OCoLC)852898533 |
| dewey-full | 511 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511 |
| dewey-search | 511 |
| dewey-sort | 3511 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06206cam a2200817 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn852898533</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130716s1985 enka ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">CAMBR</subfield><subfield code="d">IDEBK</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCF</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">YDX</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COO</subfield><subfield code="d">VTS</subfield><subfield code="d">STF</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCO</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">K6U</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">841396523</subfield><subfield code="a">985178458</subfield><subfield code="a">985402424</subfield><subfield code="a">1020562166</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107087583</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107087589</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107325630</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1107325633</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0521302455</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521302456</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780521177337</subfield><subfield code="q">(paperback)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)852898533</subfield><subfield code="z">(OCoLC)841396523</subfield><subfield code="z">(OCoLC)985178458</subfield><subfield code="z">(OCoLC)985402424</subfield><subfield code="z">(OCoLC)1020562166</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA9.59</subfield><subfield code="b">.S25 1985eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.80</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.10</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">31.12</subfield><subfield code="2">bcl</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Salomaa, Arto.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computation and automata /</subfield><subfield code="c">Arto Salomaa.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Cambridge [Cambridgeshire] ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Cambridge University Press,</subfield><subfield code="c">1985.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 284 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications ;</subfield><subfield code="v">v. 25</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 269-277) and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">8.2. SIMILAR GRAMMARS AND LANGUAGES8.3. SYSTOLIC AUTOMATA; EXERCISES; Historical and Bibliographical Remarks; References; Index</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computable functions.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85029469</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85029473</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Sequential machine theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85120149</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Fonctions calculables.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des machines séquentielles.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computable functions</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sequential machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4017848-1</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4003953-5</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="2">gnd</subfield><subfield code="0">http://d-nb.info/gnd/4120591-1</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automates mathématiques, Théorie des.</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machines séquentielles, Théorie des.</subfield><subfield code="2">ram</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Computation and automata (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCFWf9T9y4D6FVBp8qdprjd</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Salomaa, Arto.</subfield><subfield code="t">Computation and automata.</subfield><subfield code="d">Cambridge [Cambridgeshire] ; New York : Cambridge University Press, 1985</subfield><subfield code="z">0521302455</subfield><subfield code="w">(DLC) 84017571</subfield><subfield code="w">(OCoLC)11089329</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Encyclopedia of mathematics and its applications ;</subfield><subfield code="v">v. 25.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n42010632</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=570392</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH25052471</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH26478639</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10733628</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">570392</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis25836231</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10440785</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10862011</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn852898533 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:25:26Z |
| institution | BVB |
| isbn | 9781107087583 1107087589 9781107325630 1107325633 |
| language | English |
| oclc_num | 852898533 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xiii, 284 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| publisher | Cambridge University Press, |
| record_format | marc |
| series | Encyclopedia of mathematics and its applications ; |
| series2 | Encyclopedia of mathematics and its applications ; |
| spelling | Salomaa, Arto. Computation and automata / Arto Salomaa. Cambridge [Cambridgeshire] ; New York : Cambridge University Press, 1985. 1 online resource (xiii, 284 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Encyclopedia of mathematics and its applications ; v. 25 Includes bibliographical references (pages 269-277) and index. Print version record. 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. 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 Computable functions. http://id.loc.gov/authorities/subjects/sh85029469 Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Sequential machine theory. http://id.loc.gov/authorities/subjects/sh85120149 Fonctions calculables. Complexité de calcul (Informatique) Théorie des machines séquentielles. MATHEMATICS General. bisacsh Computable functions fast Computational complexity fast Sequential machine theory fast Formale Sprache gnd http://d-nb.info/gnd/4017848-1 Automatentheorie gnd http://d-nb.info/gnd/4003953-5 Komplexitätstheorie gnd http://d-nb.info/gnd/4120591-1 Complexité de calcul (informatique) ram Automates mathématiques, Théorie des. ram Machines séquentielles, Théorie des. ram has work: Computation and automata (Text) https://id.oclc.org/worldcat/entity/E39PCFWf9T9y4D6FVBp8qdprjd https://id.oclc.org/worldcat/ontology/hasWork Print version: Salomaa, Arto. Computation and automata. Cambridge [Cambridgeshire] ; New York : Cambridge University Press, 1985 0521302455 (DLC) 84017571 (OCoLC)11089329 Encyclopedia of mathematics and its applications ; v. 25. http://id.loc.gov/authorities/names/n42010632 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=570392 Volltext |
| spellingShingle | Salomaa, Arto Computation and automata / Encyclopedia of mathematics and its applications ; 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 Computable functions. http://id.loc.gov/authorities/subjects/sh85029469 Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Sequential machine theory. http://id.loc.gov/authorities/subjects/sh85120149 Fonctions calculables. Complexité de calcul (Informatique) Théorie des machines séquentielles. MATHEMATICS General. bisacsh Computable functions fast Computational complexity fast Sequential machine theory fast Formale Sprache gnd http://d-nb.info/gnd/4017848-1 Automatentheorie gnd http://d-nb.info/gnd/4003953-5 Komplexitätstheorie gnd http://d-nb.info/gnd/4120591-1 Complexité de calcul (informatique) ram Automates mathématiques, Théorie des. ram Machines séquentielles, Théorie des. ram |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85029469 http://id.loc.gov/authorities/subjects/sh85029473 http://id.loc.gov/authorities/subjects/sh85120149 http://d-nb.info/gnd/4017848-1 http://d-nb.info/gnd/4003953-5 http://d-nb.info/gnd/4120591-1 |
| title | Computation and automata / |
| title_auth | Computation and automata / |
| title_exact_search | Computation and automata / |
| title_full | Computation and automata / Arto Salomaa. |
| title_fullStr | Computation and automata / Arto Salomaa. |
| title_full_unstemmed | Computation and automata / Arto Salomaa. |
| title_short | Computation and automata / |
| title_sort | computation and automata |
| topic | Computable functions. http://id.loc.gov/authorities/subjects/sh85029469 Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Sequential machine theory. http://id.loc.gov/authorities/subjects/sh85120149 Fonctions calculables. Complexité de calcul (Informatique) Théorie des machines séquentielles. MATHEMATICS General. bisacsh Computable functions fast Computational complexity fast Sequential machine theory fast Formale Sprache gnd http://d-nb.info/gnd/4017848-1 Automatentheorie gnd http://d-nb.info/gnd/4003953-5 Komplexitätstheorie gnd http://d-nb.info/gnd/4120591-1 Complexité de calcul (informatique) ram Automates mathématiques, Théorie des. ram Machines séquentielles, Théorie des. ram |
| topic_facet | Computable functions. Computational complexity. Sequential machine theory. Fonctions calculables. Complexité de calcul (Informatique) Théorie des machines séquentielles. 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. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=570392 |
| work_keys_str_mv | AT salomaaarto computationandautomata |