Introduction to the theory of computation:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston, Mass.
Cengage Learning
2013
|
| Ausgabe: | 3. ed., internat. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 443 - 447 Hier auch später erschienene, unveränderte Nachdrucke |
| Beschreibung: | XXII, 458 S. graph. Darst. |
| ISBN: | 9781133187813 9781133187790 9780357670583 1133187811 113318779X |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV040639507 | ||
| 003 | DE-604 | ||
| 005 | 20240220 | ||
| 007 | t | ||
| 008 | 121218s2013 d||| |||| 00||| eng d | ||
| 020 | |a 9781133187813 |9 978-1-133-18781-3 | ||
| 020 | |a 9781133187790 |9 978-1-133-18779-0 | ||
| 020 | |a 9780357670583 |9 978-0-357-67058-3 | ||
| 020 | |a 1133187811 |9 1-13-318781-1 | ||
| 020 | |a 113318779X |9 1-133-18779-X | ||
| 035 | |a (OCoLC)823261244 | ||
| 035 | |a (DE-599)BVBBV040639507 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-522 |a DE-473 |a DE-83 |a DE-91G |a DE-898 |a DE-739 |a DE-20 |a DE-384 |a DE-861 |a DE-29T |a DE-N2 |a DE-355 |a DE-11 |a DE-1043 | ||
| 082 | 0 | |a 511.35 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 084 | |a DAT 500f |2 stub | ||
| 084 | |a 54.10 |2 bkl | ||
| 100 | 1 | |a Sipser, Michael |e Verfasser |0 (DE-588)131513176 |4 aut | |
| 245 | 1 | 0 | |a Introduction to the theory of computation |c Michael Sipser |
| 250 | |a 3. ed., internat. ed. | ||
| 264 | 1 | |a Boston, Mass. |b Cengage Learning |c 2013 | |
| 300 | |a XXII, 458 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. 443 - 447 | ||
| 500 | |a Hier auch später erschienene, unveränderte Nachdrucke | ||
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 2 | 1 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025466598&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-025466598 | ||
Datensatz im Suchindex
| _version_ | 1804149754198753280 |
|---|---|
| adam_text | Titel: Introduction to the theory of computation
Autor: Sipser, Michael
Jahr: 2013
CONTENTS
Preface to the First Edition xi
To the Student........................... xi
To the educator.......................... xii
The first edition.......................... xiii
Feedback to the author...................... xiii
Acknowledgments......................... xiv
Preface to the Second Edition xvii
Preface to the Third Edition xxi
Introduction 1
0.1 Automata, Computability, and Complexity............. 1
Complexity theory......................... 2
Computability theory....................... 3
Automata theory.......................... 3
0.2 Mathematical Notions and Terminology.............. 3
Sets................................. 3
Sequences and tuples....................... 6
Functions and relations...................... 7
Graphs............................... 10
Strings and languages....................... 13
Boolean logic............................ 14
Summaryof mathematical terms................. 16
0.3 Definitions, Theorems, and Proofs................. 17
Finding proofs........................... 17
0.4 Typesof Proof............................ 21
Proof by construction....................... 21
Proof by contradictdon....................... 21
Proof byinduction......................... 22
Exercises, Problems, and Solutions................... 25
VI CONTENTS
Part One: Automata and Languages 29
1 Regulär Languages 31
1.1 Finite Automata ........................... 31
Formal definition of a finite automaton............. 35
Examples of finite automata.................... 37
Formal definition of computation ................ 40
Designing finite automata..................... 41
The regulär Operations...................... 44
1.2 Nondeterminism........................... 47
Formal definition of a nondeterministic finite automaton . ... 53
Equivalence of NFAs and DFAs ................. 54
Closure under the regulär Operations............... 58
1.3 Regulär Expressions......................... 63
Formal definition of a regulär expression ............ 64
Equivalence with finite automata................. 66
1.4 Nonregular Languages........................ 77
The pumping lemma for regulär languages........... 77
Exercises, Problems, and Solutions................... 82
2 Context-Free Languages 101
2.1 Context-Free Grammars.......................102
Formal definition of a context-free grammar ..........104
Examples of context-free grammars ...............105
Designing context-free grammars ................106
Ambiguity.............................107
Chomsky normal form ......................108
2.2 Pushdown Automata.........................111
Formal definition of a pushdown automaton...........113
Examples of pushdown automata.................114
Equivalence with context-free grammars.............117
2.3 Non-Context-Free Languages....................125
The pumping lemma for context-free languages.........125
2.4 Deterministic Context-Free Languages...............130
Properties ofDCFLs.......................133
Deterministic context-free grammars ..............135
RelationshipofDPDAsandDCFGs...............146
Parsing and LR(k) Grammars...................151
Exercises, Problems, and Solutions...................154
Part Two: Computability Theory 163
3 The Church-Turing Thesis 165
3.1 Turing Machines...........................165
Formal definition of a Turing machine..............167
CONTENTS VII
Examples of Turing machines...................170
3.2 Variantsof Turing Machines.....................176
Multitape Turing machines....................176
Nondeterministic Turing machines................178
Enumerators............................180
Equivalence with other modeis..................181
3.3 The Definition of Algorithm ....................182
Hilbert s problems.........................182
Terminology for describing Turing machines..........184
Exercises, Problems, and Solutions...................187
4 Decidability 193
4.1 Decidable Languages.........................194
Decidable problems concerning regulär languages.......194
Decidable problems concerning context-free languages.....198
4.2 Undecidability............................201
The diagonalization method...................202
An undecidable language.....................207
A Turing-unrecognizable language................209
Exercises, Problems, and Solutions...................210
5 Reducibility 215
5.1 Undecidable Problems from Language Theory..........216
Reductdons via computation histories...............220
5.2 A Simple Undecidable Problem...................227
5.3 Mapping Reducibility........................234
Computable functions.......................234
Formal definition of mapping reducibility............235
Exercises, Problems, and Solutions...................239
6 Advanced Topics in Computability Theory 245
6.1 The Recursion Theorem.......................245
Self-reference ...........................246
Terminology for the recursion theorem.............249
Applications............................250
6.2 Decidability of logical theories ...................252
A decidable theory.........................255
An undecidable theory.......................257
6.3 Turing Reducibility..........................260
6.4 A Definition of Information.....................261
Minimal length descriptions ...................262
Optimality of the definition....................266
Incompressible strings and randomness.............267
Exercises, Problems, and Solutions...................270
VIII CONTENTS
PartThree: Complexity Theory 273
7 Time Complexity 275
7.1 Measuring Complexity........................275
Big-0 and small-o notation....................276
Analyzing algorithms.......................279
Complexity relationships among modeis.............282
7.2 The Class P..............................284
Polynomial time..........................284
Examples of problems in P....................286
7.3 The Class NP.............................292
Examples of problems in NP...................295
The P versus NP question ....................297
7.4 NP-completeness...........................299
Polynomial time reducibility...................300
Definition of NP-completeness..................304
The Cook-Levin Theorem....................304
7.5 Additional NP-complete Problems.................311
The vertex cover problem.....................312
The Hamiltonian path problem .................314
The subset sum problem .....................319
Exercises, Problems, and Solutions...................322
8 Space Complexity 331
8.1 Savitch s Theorem..........................333
8.2 The Class PSPACE .........................336
8.3 PSPACE-completeness .......................337
The TQBF problem........................338
Winning strategies for games...................341
Generalized geography......................343
8.4 The Classes L and NL........................348
8.5 NL-completeness ..........................351
Searching in graphs........................353
8.6 NL equals coNL...........................354
Exercises, Problems, and Solutions...................356
9 Intractability 363
9.1 Hierarchy Theorems.........................364
Exponential space completeness.................371
9.2 Relativization.............................376
Limits of the diagonalization method ..............377
9.3 Circuit Complexity..........................379
Exercises, Problems, and Solutions...................388
10 Advanced Topics in Complexity Theory 393
10.1 Approximation Algorithms .....................393
CONTENTS IX
10.2 Probabilistic Algorithms.......................396
The class BPP...........................396
Primality..............................399
Read-once branching programs..................404
10.3 Alternation..............................408
Alternating time and space....................410
The Polynomial time hierarchy..................414
10.4 Interactive Proof Systems......................415
Graph nonisomorphism......................415
Definition of the model......................416
IP = PSPACE ...........................418
10.5 Parallel Computation ........................427
Uniform Boolean circuits.....................428
The class NC ...........................430
P-completeness ..........................432
10.6 Cryptography.............................433
Secretkeys.............................433
Public-key cryptosystems.....................435
One-way functions.........................435
Trapdoor functions ........................437
Exercises, Problems, and Solutions...................439
Selected Bibliography 443
Index 448
|
| any_adam_object | 1 |
| author | Sipser, Michael |
| author_GND | (DE-588)131513176 |
| author_facet | Sipser, Michael |
| author_role | aut |
| author_sort | Sipser, Michael |
| author_variant | m s ms |
| building | Verbundindex |
| bvnumber | BV040639507 |
| classification_rvk | ST 130 ST 134 ST 136 |
| classification_tum | DAT 500f |
| ctrlnum | (OCoLC)823261244 (DE-599)BVBBV040639507 |
| dewey-full | 511.35 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.35 |
| dewey-search | 511.35 |
| dewey-sort | 3511.35 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| edition | 3. ed., internat. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02351nam a2200577 c 4500</leader><controlfield tag="001">BV040639507</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240220 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">121218s2013 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781133187813</subfield><subfield code="9">978-1-133-18781-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781133187790</subfield><subfield code="9">978-1-133-18779-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780357670583</subfield><subfield code="9">978-0-357-67058-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1133187811</subfield><subfield code="9">1-13-318781-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">113318779X</subfield><subfield code="9">1-133-18779-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)823261244</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV040639507</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-522</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-N2</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-1043</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.35</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 500f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.10</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sipser, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)131513176</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to the theory of computation</subfield><subfield code="c">Michael Sipser</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed., internat. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, Mass.</subfield><subfield code="b">Cengage Learning</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 458 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 443 - 447</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Hier auch später erschienene, unveränderte Nachdrucke</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025466598&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025466598</subfield></datafield></record></collection> |
| id | DE-604.BV040639507 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T00:28:03Z |
| institution | BVB |
| isbn | 9781133187813 9781133187790 9780357670583 1133187811 113318779X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025466598 |
| oclc_num | 823261244 |
| open_access_boolean | |
| owner | DE-522 DE-473 DE-BY-UBG DE-83 DE-91G DE-BY-TUM DE-898 DE-BY-UBR DE-739 DE-20 DE-384 DE-861 DE-29T DE-N2 DE-355 DE-BY-UBR DE-11 DE-1043 |
| owner_facet | DE-522 DE-473 DE-BY-UBG DE-83 DE-91G DE-BY-TUM DE-898 DE-BY-UBR DE-739 DE-20 DE-384 DE-861 DE-29T DE-N2 DE-355 DE-BY-UBR DE-11 DE-1043 |
| physical | XXII, 458 S. graph. Darst. |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Cengage Learning |
| record_format | marc |
| spelling | Sipser, Michael Verfasser (DE-588)131513176 aut Introduction to the theory of computation Michael Sipser 3. ed., internat. ed. Boston, Mass. Cengage Learning 2013 XXII, 458 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. 443 - 447 Hier auch später erschienene, unveränderte Nachdrucke Formale Sprache (DE-588)4017848-1 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Berechnungskomplexität (DE-588)4134751-1 s Automatentheorie (DE-588)4003953-5 s Formale Sprache (DE-588)4017848-1 s HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025466598&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Sipser, Michael Introduction to the theory of computation Formale Sprache (DE-588)4017848-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4017848-1 (DE-588)4134751-1 (DE-588)4003953-5 (DE-588)4120591-1 (DE-588)4196735-5 |
| title | Introduction to the theory of computation |
| title_auth | Introduction to the theory of computation |
| title_exact_search | Introduction to the theory of computation |
| title_full | Introduction to the theory of computation Michael Sipser |
| title_fullStr | Introduction to the theory of computation Michael Sipser |
| title_full_unstemmed | Introduction to the theory of computation Michael Sipser |
| title_short | Introduction to the theory of computation |
| title_sort | introduction to the theory of computation |
| topic | Formale Sprache (DE-588)4017848-1 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Automatentheorie (DE-588)4003953-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Formale Sprache Berechnungskomplexität Automatentheorie Komplexitätstheorie Theoretische Informatik |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025466598&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT sipsermichael introductiontothetheoryofcomputation |