Languages and machines: an introduction to the theory of computer science
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Uttar Pradesh, India
Pearson
2008
|
| Ausgabe: | third edition |
| Schriftenreihe: | Pearson international edition
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XVII, 654 Seiten |
| ISBN: | 9788131714751 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046668244 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 200414s2008 xxu |||| 00||| eng d | ||
| 020 | |a 9788131714751 |9 978-81-317-1475-1 | ||
| 035 | |a (OCoLC)1151452900 | ||
| 035 | |a (DE-599)BVBBV046668244 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-473 | ||
| 082 | 0 | |a 511.3 |2 22 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Sudkamp, Thomas A. |d 1953- |e Verfasser |0 (DE-588)123409594 |4 aut | |
| 245 | 1 | 0 | |a Languages and machines |b an introduction to the theory of computer science |c Thomas A. Sudkamp |
| 250 | |a third edition | ||
| 264 | 1 | |a Uttar Pradesh, India |b Pearson |c 2008 | |
| 300 | |a XVII, 654 Seiten | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Pearson international edition | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-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 Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |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 Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 1 | 1 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 1 | 2 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 775 | 0 | 8 | |i Äquivalent |a Sudkamp, Thomas A. |t Languages and machines |b third edition |d Bonston; Addison-Wesley, 2006 |z 0-321-31534-0 |w (DE-604)BV019844422 |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032079258&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032079258 | ||
Datensatz im Suchindex
| _version_ | 1804181381707726848 |
|---|---|
| adam_text | Contents Preface Introduction PART I Foundations Chapter 1 Mathematical Preliminaries 1.1 Set Theory 1.2 Cartesian Product, Relations, and Functions 1.3 Equivalence Relations 1.4 Countable and Uncountable Sets 1.5 1.6 8 14 16 Diagonalization and Self-Reference , Recursive Definitions 21 23 1.7 Mathematical Induction 1.8 Directed Graphs Exercises 36 27 32 Bibliographic Notes 40 Chapter 2 Languages 2.1 Strings and Languages 2.2 Finite Specification of Languages 2.3 Regular Sets and Expressions 2.4 Regular Expressions and Text Searching Exercises 58 Bibliographic Notes 42 61 45 49 54
VI Contents PART II Grammars, Automata, and Languages Chapter 3 Context-Free Grammars 3.1 Context-Free Grammars and Languages 3.2 Examples of Grammars and Languages 3.3 Regular Grammars 3.4 Verifying Grammars 3.5 Leftmost Derivations and Ambiguity 3.6 Context-Free Grammars and Programming Language Definition Exercises 68 76 81 83 89 97 Bibliographic Notes 102 Chapter 4 Normal Forms for Context-Free Grammars 4.1 Grammar Transformations 4.2 Elimination of λ-Rules 4.3 Elimination of Chain Rules 4.4 Useless Symbols 4.5 Chomsky Normal Form 4.6 The CYK Algorithm 4.7 Removal of Direct Left Recursion 4.8 Greibach Normal Form Exercises 104 106 113 116 121 124 129 131 138 Bibliographic Notes 143 Chapter 5 Finite Automata 5.1 A Finite-State Machine 5.2 Deterministic Finite Automata 5.3 5.4 5.5 State Diagrams and Examples 151 Nondeterministic Finite Automata 159 λ-Transitions 165 5.6 5.7 Removing Nondeterminism DFA Minimization 178 Exercises 184 Bibliographic Notes 145 190 147 170
Chapter б Properties of Regular Languages 6.1 Finite-State Acceptance of Regular Languages 6.2 Expression Graphs 6.3 Regular Grammars and Finite Automata 6.4 Closure Properties of Regular Languages 6.5 A Nonregular Language 6.6 The Pumping Lemma for Regular Languages 6.7 The Myhill-Nerode Theorem Exercises 191 193 196 200 203 205 211 217 Bibliographic Notes 220 Chapter 7 Pushdown Automata and Context-Free Languages 7.1 Pushdown Automata 7.2 Variations on the PDA Theme 7.3 Acceptance of Context-Free Languages 7.4 The Pumping Lemma for Context-Free Languages 7.5 Closure Properties of Context-Free Languages Exercises 227 232 243 247 Bibliographic Notes PART III 221 251 Computability Chapter 8 Turing Machines 8.1 The Standard Turing Machine 255 8.2 Turing Machines as Language Acceptors 8.3 Alternative Acceptance Criteria 8.4 Multitrack Machines 8.5 Two-Way Tape Machines 8.6 Multitape Machines 263 265 268 8.7 Nondeterministic Turing Machines 8.8 Turing Machines as Language Enumerators Exercises 288 Bibliographic Notes 259 262 293 274 282 239
VIII Contents Chapter 9 295 Turing Computable Functions 9.1 Computation of Functions 9.2 Numeric Computation 9.3 Sequential Operation of Turing Machines 9.4 Composition of Functions 9.5 Uncomputable Functions 9.6 Toward a Programming Language Exercises 295 299 301 308 312 313 320 Bibliographic Notes 323 Chapter 10 325 The Chomsky Hierarchy 10.1 Unrestricted Grammars 10.2 Context-Sensitive Grammars 10.3 Linear-Bounded Automata 10.4 The Chomsky Hierarchy Exercises 325 332 334 338 339 Bibliographic Notes 341 Chapter 11 343 Decision Problems and the Church-Turing Thesis 11.1 Representation of Decision Problems 11.2 Decision Problems and Recursive Languages 11.3 Problem Reduction 11.4 The Church-Turing Thesis 11.5 A Universal Machine Exercises 344 346 348 352 354 358 Bibliographic Notes 360 Chapter 12 Undecidability 361 12.1 12.2 The Halting Problem for Turing Machines 362 Problem Reduction and Undecidability 365 12.3 12.4 Additional Halting Problem Reductions Rice’s Theorem 371 12.5 An Unsol vable Word Problem 12.6 The Post Correspondence Problem 373 377 368
Contents 12.7 Unďecidable Problems in Context-Free Grammars Exercises 382 386 Bibliographic Notes 388 Chapter 13 Mu-Recursive Functions 389 13.1 Primitive Recursive Functions 13.2 Some Primitive Recursive Functions 13.3 Bounded Operators 398 13.4 Division Functions 404 13.5 Gödel Numbering and Course-of-Values Recursion 13.6 Computable Partial Functions 13.7 Turing Computability and Mu-Recursive Functions 13.8 The Church-Turing Thesis Revisited Exercises 389 394 406 410 415 421 424 Bibliographic Notes PART IV IX 430 Computational Complexity Chapter 14 Time Complexity 433 14.1 Measurement of Complexity 14.2 Rates of Growth 14.3 Time Complexity of a Turing Machine 14.4 Complexity and Turing Machine Variations 14.5 Linear Speedup 14.6 Properties of Time Complexity of Languages 14.7 Simulation of Computer Computations Exercises 434 436 442 446 448 451 458 462 Bibliographic Notes 464 Chapter 15 T, NT, and Cook’s Theorem 465 15.1 Time Complexity of Nondeterministic Turing Machines 15.2 The Classes T and NT 15.3 Problem Representation and Complexity 468 15.4 Decision Problems and Complexity Classes 15.5 The Hamiltonian Circuit Problem 474 469 472 466
X Contents 15.6 Polynomial-Time Reduction 15.7 ? = Ν?Ί 15.8 The Satisfiability Problem 15.9 Complexity Class Relations Exercises 477 479 481 492 493 Bibliógraphic Notes 496 Chapter 16 NP-Complete Problems 16.1 Reduction and NP-Complete Problems 16.2 The З-Satisfiability Problem 16.3 Reductions from 3-Satisfiability 16.4 Reduction and Subproblems 16.5 Optimization Problems 16.6 Approximation Algorithms 16.7 Approximation Schemes Exercises 497 498 500 513 517 519 523 526 Bibliographic Notes 528 Chapter 17 Additional Complexity Classes 17.1 Derivative Complexity Classes 17.2 Space Complexity 17.3 Relations between Space and Time Complexity 17.4 Т-Space, NT-Space, and Savitch’s Theorem 17.5 (P-Space Completeness 544 17.6 An Intractable Problem 548 Exercises 550 Bibliographic Notes PART V 529 532 551 Deterministic Parsing Chapter 18 Parsing: An introduction 18.1 18.2 The Graph of a Grammar 555 A Top-Down Parser 557 18.3 18.4 Reductions and Bottom-Up Parsing A Bottom-Up Parser 563 561 535 540
Contents 18.5 Parsing and Compiling Exercises XI 567 568 Bibliographic Notes 569 Chapter 19 LL(k) Grammars 19.1 Lookahead in Context-Free Grammars 571 19.2 FIRST, FOLLOW, and Lookahead Sets 576 19.3 Strong LL(k) Grammars 19.4 Construction of FIRSTį Sets 19.5 Construction of FOLLOWt Sets 19.6 A.Strong LL(1) Grammar 19.7 A Strong LL(k) Parser 19.8 LL(¿) Grammars Exercises 579 580 583 585 587 589 591 Bibliographic Notes 593 Chapter 20 LR(k) Grammars 20.1 595 LR(0) Contexts 595 20.2 An LR(0) Parser 20.3 The LR(0) Machine 599 601 20.4 Acceptance by the LR(0) Machine 20.5 LR(1) Grammars Exercises 606 612 620 Bibliographic Notes 621 Appendix I Index of Notation 623 Appendix II The Greek Alphabet 627 Appendix III The ASCII Character Set 629 Appendix IV Backus-Naur Form Definition of Java 631 Bibliography 541 Subject Index 549
|
| adam_txt |
Contents Preface Introduction PART I Foundations Chapter 1 Mathematical Preliminaries 1.1 Set Theory 1.2 Cartesian Product, Relations, and Functions 1.3 Equivalence Relations 1.4 Countable and Uncountable Sets 1.5 1.6 8 14 16 Diagonalization and Self-Reference , Recursive Definitions 21 23 1.7 Mathematical Induction 1.8 Directed Graphs Exercises 36 27 32 Bibliographic Notes 40 Chapter 2 Languages 2.1 Strings and Languages 2.2 Finite Specification of Languages 2.3 Regular Sets and Expressions 2.4 Regular Expressions and Text Searching Exercises 58 Bibliographic Notes 42 61 45 49 54
VI Contents PART II Grammars, Automata, and Languages Chapter 3 Context-Free Grammars 3.1 Context-Free Grammars and Languages 3.2 Examples of Grammars and Languages 3.3 Regular Grammars 3.4 Verifying Grammars 3.5 Leftmost Derivations and Ambiguity 3.6 Context-Free Grammars and Programming Language Definition Exercises 68 76 81 83 89 97 Bibliographic Notes 102 Chapter 4 Normal Forms for Context-Free Grammars 4.1 Grammar Transformations 4.2 Elimination of λ-Rules 4.3 Elimination of Chain Rules 4.4 Useless Symbols 4.5 Chomsky Normal Form 4.6 The CYK Algorithm 4.7 Removal of Direct Left Recursion 4.8 Greibach Normal Form Exercises 104 106 113 116 121 124 129 131 138 Bibliographic Notes 143 Chapter 5 Finite Automata 5.1 A Finite-State Machine 5.2 Deterministic Finite Automata 5.3 5.4 5.5 State Diagrams and Examples 151 Nondeterministic Finite Automata 159 λ-Transitions 165 5.6 5.7 Removing Nondeterminism DFA Minimization 178 Exercises 184 Bibliographic Notes 145 190 147 170
Chapter б Properties of Regular Languages 6.1 Finite-State Acceptance of Regular Languages 6.2 Expression Graphs 6.3 Regular Grammars and Finite Automata 6.4 Closure Properties of Regular Languages 6.5 A Nonregular Language 6.6 The Pumping Lemma for Regular Languages 6.7 The Myhill-Nerode Theorem Exercises 191 193 196 200 203 205 211 217 Bibliographic Notes 220 Chapter 7 Pushdown Automata and Context-Free Languages 7.1 Pushdown Automata 7.2 Variations on the PDA Theme 7.3 Acceptance of Context-Free Languages 7.4 The Pumping Lemma for Context-Free Languages 7.5 Closure Properties of Context-Free Languages Exercises 227 232 243 247 Bibliographic Notes PART III 221 251 Computability Chapter 8 Turing Machines 8.1 The Standard Turing Machine 255 8.2 Turing Machines as Language Acceptors 8.3 Alternative Acceptance Criteria 8.4 Multitrack Machines 8.5 Two-Way Tape Machines 8.6 Multitape Machines 263 265 268 8.7 Nondeterministic Turing Machines 8.8 Turing Machines as Language Enumerators Exercises 288 Bibliographic Notes 259 262 293 274 282 239
VIII Contents Chapter 9 295 Turing Computable Functions 9.1 Computation of Functions 9.2 Numeric Computation 9.3 Sequential Operation of Turing Machines 9.4 Composition of Functions 9.5 Uncomputable Functions 9.6 Toward a Programming Language Exercises 295 299 301 308 312 313 320 Bibliographic Notes 323 Chapter 10 325 The Chomsky Hierarchy 10.1 Unrestricted Grammars 10.2 Context-Sensitive Grammars 10.3 Linear-Bounded Automata 10.4 The Chomsky Hierarchy Exercises 325 332 334 338 339 Bibliographic Notes 341 Chapter 11 343 Decision Problems and the Church-Turing Thesis 11.1 Representation of Decision Problems 11.2 Decision Problems and Recursive Languages 11.3 Problem Reduction 11.4 The Church-Turing Thesis 11.5 A Universal Machine Exercises 344 346 348 352 354 358 Bibliographic Notes 360 Chapter 12 Undecidability 361 12.1 12.2 The Halting Problem for Turing Machines 362 Problem Reduction and Undecidability 365 12.3 12.4 Additional Halting Problem Reductions Rice’s Theorem 371 12.5 An Unsol vable Word Problem 12.6 The Post Correspondence Problem 373 377 368
Contents 12.7 Unďecidable Problems in Context-Free Grammars Exercises 382 386 Bibliographic Notes 388 Chapter 13 Mu-Recursive Functions 389 13.1 Primitive Recursive Functions 13.2 Some Primitive Recursive Functions 13.3 Bounded Operators 398 13.4 Division Functions 404 13.5 Gödel Numbering and Course-of-Values Recursion 13.6 Computable Partial Functions 13.7 Turing Computability and Mu-Recursive Functions 13.8 The Church-Turing Thesis Revisited Exercises 389 394 406 410 415 421 424 Bibliographic Notes PART IV IX 430 Computational Complexity Chapter 14 Time Complexity 433 14.1 Measurement of Complexity 14.2 Rates of Growth 14.3 Time Complexity of a Turing Machine 14.4 Complexity and Turing Machine Variations 14.5 Linear Speedup 14.6 Properties of Time Complexity of Languages 14.7 Simulation of Computer Computations Exercises 434 436 442 446 448 451 458 462 Bibliographic Notes 464 Chapter 15 T, NT, and Cook’s Theorem 465 15.1 Time Complexity of Nondeterministic Turing Machines 15.2 The Classes T and NT 15.3 Problem Representation and Complexity 468 15.4 Decision Problems and Complexity Classes 15.5 The Hamiltonian Circuit Problem 474 469 472 466
X Contents 15.6 Polynomial-Time Reduction 15.7 ? = Ν?Ί 15.8 The Satisfiability Problem 15.9 Complexity Class Relations Exercises 477 479 481 492 493 Bibliógraphic Notes 496 Chapter 16 NP-Complete Problems 16.1 Reduction and NP-Complete Problems 16.2 The З-Satisfiability Problem 16.3 Reductions from 3-Satisfiability 16.4 Reduction and Subproblems 16.5 Optimization Problems 16.6 Approximation Algorithms 16.7 Approximation Schemes Exercises 497 498 500 513 517 519 523 526 Bibliographic Notes 528 Chapter 17 Additional Complexity Classes 17.1 Derivative Complexity Classes 17.2 Space Complexity 17.3 Relations between Space and Time Complexity 17.4 Т-Space, NT-Space, and Savitch’s Theorem 17.5 (P-Space Completeness 544 17.6 An Intractable Problem 548 Exercises 550 Bibliographic Notes PART V 529 532 551 Deterministic Parsing Chapter 18 Parsing: An introduction 18.1 18.2 The Graph of a Grammar 555 A Top-Down Parser 557 18.3 18.4 Reductions and Bottom-Up Parsing A Bottom-Up Parser 563 561 535 540
Contents 18.5 Parsing and Compiling Exercises XI 567 568 Bibliographic Notes 569 Chapter 19 LL(k) Grammars 19.1 Lookahead in Context-Free Grammars 571 19.2 FIRST, FOLLOW, and Lookahead Sets 576 19.3 Strong LL(k) Grammars 19.4 Construction of FIRSTį Sets 19.5 Construction of FOLLOWt Sets 19.6 A.Strong LL(1) Grammar 19.7 A Strong LL(k) Parser 19.8 LL(¿) Grammars Exercises 579 580 583 585 587 589 591 Bibliographic Notes 593 Chapter 20 LR(k) Grammars 20.1 595 LR(0) Contexts 595 20.2 An LR(0) Parser 20.3 The LR(0) Machine 599 601 20.4 Acceptance by the LR(0) Machine 20.5 LR(1) Grammars Exercises 606 612 620 Bibliographic Notes 621 Appendix I Index of Notation 623 Appendix II The Greek Alphabet 627 Appendix III The ASCII Character Set 629 Appendix IV Backus-Naur Form Definition of Java 631 Bibliography 541 Subject Index 549 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Sudkamp, Thomas A. 1953- |
| author_GND | (DE-588)123409594 |
| author_facet | Sudkamp, Thomas A. 1953- |
| author_role | aut |
| author_sort | Sudkamp, Thomas A. 1953- |
| author_variant | t a s ta tas |
| building | Verbundindex |
| bvnumber | BV046668244 |
| classification_rvk | ST 130 |
| ctrlnum | (OCoLC)1151452900 (DE-599)BVBBV046668244 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | third edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02043nam a2200493zc 4500</leader><controlfield tag="001">BV046668244</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">200414s2008 xxu |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9788131714751</subfield><subfield code="9">978-81-317-1475-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1151452900</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046668244</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">22</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="100" ind1="1" ind2=" "><subfield code="a">Sudkamp, Thomas A.</subfield><subfield code="d">1953-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123409594</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Languages and machines</subfield><subfield code="b">an introduction to the theory of computer science</subfield><subfield code="c">Thomas A. Sudkamp</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">third edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Uttar Pradesh, India</subfield><subfield code="b">Pearson</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 654 Seiten</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="490" ind1="0" ind2=" "><subfield code="a">Pearson international edition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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="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">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">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="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">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="775" ind1="0" ind2="8"><subfield code="i">Äquivalent</subfield><subfield code="a">Sudkamp, Thomas A.</subfield><subfield code="t">Languages and machines</subfield><subfield code="b">third edition</subfield><subfield code="d">Bonston; Addison-Wesley, 2006</subfield><subfield code="z">0-321-31534-0</subfield><subfield code="w">(DE-604)BV019844422</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</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=032079258&sequence=000001&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-032079258</subfield></datafield></record></collection> |
| id | DE-604.BV046668244 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T14:20:50Z |
| indexdate | 2024-07-10T08:50:45Z |
| institution | BVB |
| isbn | 9788131714751 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032079258 |
| oclc_num | 1151452900 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG |
| owner_facet | DE-473 DE-BY-UBG |
| physical | XVII, 654 Seiten |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Pearson |
| record_format | marc |
| series2 | Pearson international edition |
| spelling | Sudkamp, Thomas A. 1953- Verfasser (DE-588)123409594 aut Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp third edition Uttar Pradesh, India Pearson 2008 XVII, 654 Seiten txt rdacontent n rdamedia nc rdacarrier Pearson international edition Formal languages Machine theory Computational complexity Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 s DE-604 Formale Sprache (DE-588)4017848-1 s Automatentheorie (DE-588)4003953-5 s Komplexitätstheorie (DE-588)4120591-1 s Äquivalent Sudkamp, Thomas A. Languages and machines third edition Bonston; Addison-Wesley, 2006 0-321-31534-0 (DE-604)BV019844422 Digitalisierung UB Bamberg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032079258&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Sudkamp, Thomas A. 1953- Languages and machines an introduction to the theory of computer science Formal languages Machine theory Computational complexity Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4120591-1 (DE-588)4003953-5 (DE-588)4017848-1 |
| title | Languages and machines an introduction to the theory of computer science |
| title_auth | Languages and machines an introduction to the theory of computer science |
| title_exact_search | Languages and machines an introduction to the theory of computer science |
| title_exact_search_txtP | Languages and machines an introduction to the theory of computer science |
| title_full | Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp |
| title_fullStr | Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp |
| title_full_unstemmed | Languages and machines an introduction to the theory of computer science Thomas A. Sudkamp |
| title_short | Languages and machines |
| title_sort | languages and machines an introduction to the theory of computer science |
| title_sub | an introduction to the theory of computer science |
| topic | Formal languages Machine theory Computational complexity Theoretische Informatik (DE-588)4196735-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Automatentheorie (DE-588)4003953-5 gnd Formale Sprache (DE-588)4017848-1 gnd |
| topic_facet | Formal languages Machine theory Computational complexity Theoretische Informatik Komplexitätstheorie Automatentheorie Formale Sprache |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032079258&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT sudkampthomasa languagesandmachinesanintroductiontothetheoryofcomputerscience |