Elements of computation theory:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
London
Springer
2009
|
| Series: | Texts in computer science
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XIII, 422 S. graph. Darst. |
| ISBN: | 9781848824966 9781848824973 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035415018 | ||
| 003 | DE-604 | ||
| 005 | 20090528 | ||
| 007 | t | ||
| 008 | 090403s2009 d||| |||| 00||| eng d | ||
| 020 | |a 9781848824966 |9 978-1-84882-496-6 | ||
| 020 | |a 9781848824973 |9 978-1-84882-497-3 | ||
| 035 | |a (OCoLC)552490875 | ||
| 035 | |a (DE-599)BVBBV035415018 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-703 |a DE-824 |a DE-11 | ||
| 050 | 0 | |a QA76 | |
| 082 | 0 | |a 004 | |
| 084 | |a ST 136 |0 (DE-625)143591: |2 rvk | ||
| 100 | 1 | |a Singh, Arindama |e Verfasser |0 (DE-588)138264635 |4 aut | |
| 245 | 1 | 0 | |a Elements of computation theory |c Arindama Singh |
| 264 | 1 | |a London |b Springer |c 2009 | |
| 300 | |a XIII, 422 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Texts in computer science | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Machine theory | |
| 650 | 0 | 7 | |a Berechnungstheorie |0 (DE-588)4005581-4 |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 Berechnungstheorie |0 (DE-588)4005581-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Bayreuth |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017335538&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017335538 | ||
Record in the Search Index
| _version_ | 1804138854951682048 |
|---|---|
| adam_text | Contents
1
Mathematical Preliminaries
..................................... 1
1.1
Introduction
............................................... 1
1.2
Sets
...................................................... 1
1.3
Relations and Graphs
....................................... 3
1.4
Functions and Counting
..................................... 8
1.5
Proof Techniques
........................................... 16
1.6
Summary and Problems
..................................... 25
2
Regular Languages
............................................. 31
2.1
Introduction
............................................... 31
2.2
Language Basics
........................................... 32
2.3
Regular Expressions
........................................ 36
2.4
Regular Grammars
......................................... 40
2.5
Deterministic Finite Automata
................................ 45
2.6
Nondeterministic Finite Automata
............................ 55
2.7
Summary and Additional Problems
........................... 64
3
Equivalences
................................................... 69
3.1
Introduction
............................................... 69
3.2
NFA to
DEA
............................................... 69
3.3
Finite Automata and Regular Grammars
....................... 76
3.4
Regular Expression to NFA
.................................. 79
3.5
NFA to Regular Expression
.................................. 82
3.6
Summary and Additional Problems
........................... 90
4
Structure of Regular Languages
.................................. 93
4.1
Introduction
............................................... 93
4.2
Closure Properties
.......................................... 94
4.3
Nonregular Languages
...................................... 98
4.4
Myhill-Nerode Theorem
.................................... 105
4.5
State Minimization
......................................... 110
4.6
Summary and Additional Problems
........................... 119
xii Contents
Context-free Languages
......................................... 125
5.1
Introduction
............................................... 125
5.2
Context-free Grammars
..................................... 125
5.3
Parse Trees
................................................ 132
5.4
Ambiguity
................................................ 137
5.5
Eliminating Ugly Productions
................................ 141
5.6
Normal Forms
............................................. 147
5.7
Summary and Additional Problems
........................... 155
Structure of CFLs
.............................................. 159
6.1
Introduction
............................................... 159
6.2
Pushdown Automata
........................................ 159
6.3
CFG andPDA
............................................. 169
6.4
Pumping Lemma
........................................... 175
6.5
Closure Properties of CFLs
.................................. 182
6.6
Deterministic Pushdown Automata
............................ 186
6.7
Summary and Additional Problems
........................... 191
Computably Enumerable Languages
.............................. 201
7.1
Introduction
............................................... 201
7.2
Unrestricted Grammars
..................................... 201
7.3
Turing Machines
........................................... 205
7.4
Acceptance and Rejection
................................... 210
7.5
Using Old Machines
........................................ 217
7.6
Multitape TMs
............................................. 228
7.7
Nondeterministic TMs and Grammars
......................... 233
7.8
Summary and Additional Problems
........................... 240
A Noncomputably Enumerable Language
......................... 245
8.1
Introduction
............................................... 245
8.2
Turing Machines as Computers
............................... 246
8.3
TMs as Language Deciders
.................................. 251
8.4
How Many Machines?
...................................... 257
8.5
Acceptance Problem
........................................ 261
8.6
Chomsky Hierarchy
........................................ 267
8.7
Summary and Additional Problems
........................... 272
Algorithmic Solvability
.......................................... 281
9.1
Introduction
............................................... 281
9.2
Problem Reduction
......................................... 282
9.3
Rice s Theorem
............................................ 287
9.4
About Finite Automata
...................................... 293
9.5
AboutPDA
............................................... 295
9.6
Post s Correspondence Problem
............................... 301
9.7
About Logical Theories
..................................... 307
9.8
Other Interesting Problems
.................................. 314
9.9
Summary and Additional Problems
........................... 316
Contents xiii
10
Computational Complexity
...................................... 327
10.1
Introduction
............................................... 327
10.2
Rate of Growth of Functions
................................. 328
10.3
Complexity Classes
......................................... 333
10.4
Space Complexity
.......................................... 338
10.5
Time Complexity
.......................................... 342
10.6
The Class NP
.............................................. 348
10.7 MP-Completeness.......................................... 352
10.8
Some JVP-Complete Problems
................................ 358
10.9
Dealing with iVP-Complete Problems
.......................... 369
10.10
Summary and Additional Problems
........................... 372
Answers and Hints to Selected Problems
.............................. 385
References
......................................................... 407
Index
............................................................. 415
|
| any_adam_object | 1 |
| author | Singh, Arindama |
| author_GND | (DE-588)138264635 |
| author_facet | Singh, Arindama |
| author_role | aut |
| author_sort | Singh, Arindama |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV035415018 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 136 |
| ctrlnum | (OCoLC)552490875 (DE-599)BVBBV035415018 |
| dewey-full | 004 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004 |
| dewey-search | 004 |
| dewey-sort | 14 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01557nam a2200433 c 4500</leader><controlfield tag="001">BV035415018</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090528 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090403s2009 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848824966</subfield><subfield code="9">978-1-84882-496-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848824973</subfield><subfield code="9">978-1-84882-497-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)552490875</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035415018</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</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">Singh, Arindama</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)138264635</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Elements of computation theory</subfield><subfield code="c">Arindama Singh</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 422 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="490" ind1="0" ind2=" "><subfield code="a">Texts in computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</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">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">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bayreuth</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=017335538&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-017335538</subfield></datafield></record></collection> |
| id | DE-604.BV035415018 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T21:34:49Z |
| institution | BVB |
| isbn | 9781848824966 9781848824973 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017335538 |
| oclc_num | 552490875 |
| open_access_boolean | |
| owner | DE-20 DE-703 DE-824 DE-11 |
| owner_facet | DE-20 DE-703 DE-824 DE-11 |
| physical | XIII, 422 S. graph. Darst. |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer |
| record_format | marc |
| series2 | Texts in computer science |
| spelling | Singh, Arindama Verfasser (DE-588)138264635 aut Elements of computation theory Arindama Singh London Springer 2009 XIII, 422 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Texts in computer science Informatik Computer science Machine theory Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 s DE-604 Formale Sprache (DE-588)4017848-1 s Digitalisierung UB Bayreuth application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017335538&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Singh, Arindama Elements of computation theory Informatik Computer science Machine theory Berechnungstheorie (DE-588)4005581-4 gnd Formale Sprache (DE-588)4017848-1 gnd |
| subject_GND | (DE-588)4005581-4 (DE-588)4017848-1 |
| title | Elements of computation theory |
| title_auth | Elements of computation theory |
| title_exact_search | Elements of computation theory |
| title_full | Elements of computation theory Arindama Singh |
| title_fullStr | Elements of computation theory Arindama Singh |
| title_full_unstemmed | Elements of computation theory Arindama Singh |
| title_short | Elements of computation theory |
| title_sort | elements of computation theory |
| topic | Informatik Computer science Machine theory Berechnungstheorie (DE-588)4005581-4 gnd Formale Sprache (DE-588)4017848-1 gnd |
| topic_facet | Informatik Computer science Machine theory Berechnungstheorie Formale Sprache |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017335538&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT singharindama elementsofcomputationtheory |