Introduction to languages and the theory of computation:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
McGraw-Hill
2011
|
| Ausgabe: | 4. ed., internat. ed. |
| Schriftenreihe: | McGraw-Hill higher education
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XII, 436 S. |
| ISBN: | 9780071289429 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV040129897 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 120511s2011 xxu |||| 00||| eng d | ||
| 020 | |a 9780071289429 |9 978-0-07-128942-9 | ||
| 035 | |a (OCoLC)796220659 | ||
| 035 | |a (DE-599)BVBBV040129897 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-473 | ||
| 050 | 0 | |a QA267.5.S4 | |
| 082 | 0 | |a 511.3 |2 21 | |
| 084 | |a CC 4800 |0 (DE-625)17631: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Martin, John C. |e Verfasser |0 (DE-588)124369847 |4 aut | |
| 245 | 1 | 0 | |a Introduction to languages and the theory of computation |c John C. Martin |
| 250 | |a 4. ed., internat. ed. | ||
| 264 | 1 | |a Boston [u.a.] |b McGraw-Hill |c 2011 | |
| 300 | |a XII, 436 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a McGraw-Hill higher education | |
| 650 | 4 | |a Fonctions calculables | |
| 650 | 4 | |a Machines séquentielles, Théorie des | |
| 650 | 4 | |a Computable functions | |
| 650 | 4 | |a Sequential machine theory | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungstheorie |0 (DE-588)4005581-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmiersprache |0 (DE-588)4047409-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Turing-Maschine |0 (DE-588)4203525-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | 1 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 0 | 2 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 0 | 3 | |a Turing-Maschine |0 (DE-588)4203525-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Berechnungstheorie |0 (DE-588)4005581-4 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Programmiersprache |0 (DE-588)4047409-4 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024987084&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024987084 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804149094240747520 |
|---|---|
| adam_text | CONTENTS
Preface vii
Introduction x
CHAPTER
1
Mathematical Tools and
Techniques
1
1.1
Logic and Proofs
1
1.2
Sets
8
1-3
Functions and Equivalence Relations
1.4
Languages
17
1.5
Recursive Definitions
21
1.6
Structural Induction
26
Exercises
34
CHAPTER
2
Finite Automata and the
Languages They Accept
45
2.1
Finite Automata: Examples and
Definitions
45
2.2
Accepting the Union, Intersection, or
Difference of Two Languages
54
2.3
Distinguishing One String
from Another
58
2.4
The Pumping Lemma
63
2.5
How to Build a Simple Computer
Using Equivalence Classes
68
2.6
Minimizing the Number of States in
a Finite Automaton
73
Exercises
77
CHAPTERS
Regular Expressions,
Nondeterminism, and Kleene s
Theorem
92
3.1
Regular Languages and Regular
Expressions
92
3.2
Nondeterministic Finite Automata
96
3.3
The Nondeterminism in an NFA Can
Be Eliminated
104
12 3.4
Kleene s Theorem, Part
1 110
3.5
Kleene s Theorem, Part
2 114
Exercises
117
chapter4
Context-Free Languages
130
4.1
Using Grammar Rules to Define a
Language
130
4.2
Context-Free Grammars: Definitions
and More Examples
134
4.3
Regular Languages and Regular
Grammars
138
4.4
Derivation Trees and Ambiguity
141
4.5
Simplified Forms and Normal Forms
149
Exercises
154
CHAPTERS
Pushdown Automata
164
5.1
Definitions and Examples
164
5.2
Deterministic Pushdown Automata
172
iv
Contents
5.3
A PDA from a Given CFG
176
5.4
A CFG from a Given PDA
184
5.5
Parsing
191
Exercises
196
C H
A PTE
R
6
Context-Free and
Non-Context-Free Languages
205
6.1
The Pumping Lemma for
Context-Free Languages
205
6.2
Intersections and Complements of
CFLs
214
6.3
Decision Problems Involving
Context-Free Languages
218
Exercises
220
CHAPTER
7
Turing Machines
224
7.1
A General Model of Computation
224
7.2
Turing Machines as Language
Acceptors
229
7.3
Turing Machines That Compute
Partial Functions
234
7.4
Combining Turing Machines
238
7.5
Multitape Turing Machines
243
7.6
The Church-Turing Thesis
247
7.7
Nondeterministic Turing Machines
248
7.8
Universal Turing Machines
252
Exercises
257
CHAPTER
8
Recursively Enumerable
Languages
265
8.1
Recursively Enumerable
and Recursive
265
8.2
Enumerating a Language
268
8.3
More General Grammars
271
8.4
Context-Sensitive Languages and the
Chomsky Hierarchy
277
8.5
Not Every Language Is Recursively
Enumerable
283
Exercises
290
CHAPTERS
Undecidable Problems
299
9.1
A Language That Can t Be
Accepted, and a Problem That Can t
Be Decided
299
9.2
Reductions and the Halting
Problem
304
9.3
More Decision Problems Involving
Turing Machines
308
9.4
Post s Correspondence Problem
314
9.5
Undecidable Problems Involving
Context-Free Languages
321
Exercises
326
CHAPTER
10
Computable Functions
331
10.1
Primitive Recursive Functions
331
10.2
Quantification. Minimalization. and
μ
-Recursive
Functions
338
10.3
Godei
Numbering
344
10.4
All Computable Functions Are
μ
-Recursive
348
10.5
Other Approaches to Computability
352
Exercises
353
CHAPTER
11
Introduction to Computational
Complexity
358
11.1
The Time Complexity of a Turing
Machine, and the Set
Ρ
358
vi
Contents
11.2
The Set
NP
and Polynomial Solutions to Selected
Verifiability
363
Exercises
389
11.3
Polynomial-Time Reductions and
¿vp-compieteness
369
Selected Bibliography
425
11.4
The Cook-Levin Theorem
373
Index of Notation
427
11.5
Some Other NP-Complete Problems
378 . .
.,-,ο
index
4¿o
Exercises
383
|
| any_adam_object | 1 |
| author | Martin, John C. |
| author_GND | (DE-588)124369847 |
| author_facet | Martin, John C. |
| author_role | aut |
| author_sort | Martin, John C. |
| author_variant | j c m jc jcm |
| building | Verbundindex |
| bvnumber | BV040129897 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.5.S4 |
| callnumber-search | QA267.5.S4 |
| callnumber-sort | QA 3267.5 S4 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | CC 4800 ST 130 ST 136 |
| ctrlnum | (OCoLC)796220659 (DE-599)BVBBV040129897 |
| 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 Philosophie |
| edition | 4. ed., internat. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02443nam a2200613zc 4500</leader><controlfield tag="001">BV040129897</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120511s2011 xxu |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780071289429</subfield><subfield code="9">978-0-07-128942-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)796220659</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV040129897</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</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="050" ind1=" " ind2="0"><subfield code="a">QA267.5.S4</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">CC 4800</subfield><subfield code="0">(DE-625)17631:</subfield><subfield code="2">rvk</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 136</subfield><subfield code="0">(DE-625)143591:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Martin, John C.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124369847</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to languages and the theory of computation</subfield><subfield code="c">John C. Martin</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">4. ed., internat. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">McGraw-Hill</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 436 S.</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">McGraw-Hill higher education</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fonctions calculables</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machines séquentielles, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequential machine theory</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">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</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="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" 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="0" 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="0" ind2="2"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</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">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Programmiersprache</subfield><subfield code="0">(DE-588)4047409-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg</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=024987084&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-024987084</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV040129897 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:17:34Z |
| institution | BVB |
| isbn | 9780071289429 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024987084 |
| oclc_num | 796220659 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG |
| owner_facet | DE-473 DE-BY-UBG |
| physical | XII, 436 S. |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | McGraw-Hill |
| record_format | marc |
| series2 | McGraw-Hill higher education |
| spelling | Martin, John C. Verfasser (DE-588)124369847 aut Introduction to languages and the theory of computation John C. Martin 4. ed., internat. ed. Boston [u.a.] McGraw-Hill 2011 XII, 436 S. txt rdacontent n rdamedia nc rdacarrier McGraw-Hill higher education Fonctions calculables Machines séquentielles, Théorie des Computable functions Sequential machine theory Automatentheorie (DE-588)4003953-5 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Programmiersprache (DE-588)4047409-4 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Automatentheorie (DE-588)4003953-5 s Formale Sprache (DE-588)4017848-1 s Berechenbarkeit (DE-588)4138368-0 s Turing-Maschine (DE-588)4203525-9 s DE-604 Berechnungstheorie (DE-588)4005581-4 s 1\p DE-604 Programmiersprache (DE-588)4047409-4 s 2\p DE-604 Digitalisierung UB Bamberg application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024987084&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Martin, John C. Introduction to languages and the theory of computation Fonctions calculables Machines séquentielles, Théorie des Computable functions Sequential machine theory Automatentheorie (DE-588)4003953-5 gnd Berechnungstheorie (DE-588)4005581-4 gnd Programmiersprache (DE-588)4047409-4 gnd Formale Sprache (DE-588)4017848-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Turing-Maschine (DE-588)4203525-9 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4005581-4 (DE-588)4047409-4 (DE-588)4017848-1 (DE-588)4138368-0 (DE-588)4203525-9 |
| title | Introduction to languages and the theory of computation |
| title_auth | Introduction to languages and the theory of computation |
| title_exact_search | Introduction to languages and the theory of computation |
| title_full | Introduction to languages and the theory of computation John C. Martin |
| title_fullStr | Introduction to languages and the theory of computation John C. Martin |
| title_full_unstemmed | Introduction to languages and the theory of computation John C. Martin |
| title_short | Introduction to languages and the theory of computation |
| title_sort | introduction to languages and the theory of computation |
| topic | Fonctions calculables Machines séquentielles, Théorie des Computable functions Sequential machine theory Automatentheorie (DE-588)4003953-5 gnd Berechnungstheorie (DE-588)4005581-4 gnd Programmiersprache (DE-588)4047409-4 gnd Formale Sprache (DE-588)4017848-1 gnd Berechenbarkeit (DE-588)4138368-0 gnd Turing-Maschine (DE-588)4203525-9 gnd |
| topic_facet | Fonctions calculables Machines séquentielles, Théorie des Computable functions Sequential machine theory Automatentheorie Berechnungstheorie Programmiersprache Formale Sprache Berechenbarkeit Turing-Maschine |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024987084&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT martinjohnc introductiontolanguagesandthetheoryofcomputation |