search for books and compare prices
Tables of Contents for DNA Computing
Chapter/Section Title
Page #
Page Count
Introduction: DNA Computing in a Nutshell
1
6
Part I: Background and Motivation
7
68
1 DNA: Its Structure and Processing
9
34
1.1 The Structure of DNA
9
10
1.2 Operations on DNA Molecules
19
17
1.3 Reading out the Sequence
36
4
1.4 Bibliographical Notes
40
3
2 Beginnings of Molecular Computing
43
32
2.1 Adleman's Experiment
43
7
2.2 Can We Solve the Satisfiability Problem and Break the DES Code?
50
15
2.3 Paradigm of Computing--Some Rethinking
65
6
2.4 DNA Computing: Hopes and Warnings
71
4
Part II: Mathematical Theory
75
308
3 Introduction to Formal Language Theory
77
40
3.1 Basic Notions, Grammars, Automata, Grammar Systems
77
21
3.2 Characterizations of Recursively Enumerable Languages
98
9
3.3 Universal Turing Machines and Type-O Grammars
107
9
3.4 Bibliographical Notes
116
1
4 Sticker Systems
117
34
4.1 The Operation of Sticking
117
5
4.2 Sticker Systems; Classifications
122
5
4.3 The Generative Capacity of Sticker Systems
127
9
4.4 Representations of Regular and Linear Languages
136
3
4.5 Characterizations of Recursively Enumerable Languages
139
3
4.6 More About Regular Sticker Systems
142
7
4.7 Bibliographical Notes
149
2
5 Watson-Crick Automata
151
36
5.1 Watson-Crick Finite Automata
152
3
5.2 Relationships Between the WK Families
155
7
5.3 Characterizations of Recursively Enumerable Languages
162
4
5.4 Watson-Crick Finite Transducers
166
2
5.5 Further Variants of Watson-Crick Finite Automata
168
6
5.6 Watson-Crick Automata with a Watson-Crick Memory
174
6
5.7 Universality Results for Watson-Crick Automata
180
6
5.8 Bibliographical Notes
186
1
6 Insertion-Deletion Systems
187
30
6.1 Inserting-Deleting in the DNA Framework
187
2
6.2 Characterizations of Recursively Enumerable Languages
189
11
6.3 One Symbol Insertion-Deletion Systems
200
6
6.4 Using Only Insertion
206
9
6.5 Bibliographical Notes
215
2
7 Splicing Systems
217
40
7.1 From DNA Recombination to the Splicing Operation
217
4
7.2 Non-Iterated Splicing as an Operation with Languages
221
8
7.3 Iterated Splicing as an Operation with Languages
229
12
7.4 Extended H Systems; Generative Power
241
8
7.5 Simple H Systems
249
6
7.6 Bibliographical Notes
255
2
8 Universality by Finite H Systems
257
50
8.1 Using 2-Splicing Instead of 1-Splicing
257
2
8.2 Permitting and Forbidding Contexts
259
12
8.3 Target Languages
271
5
8.4 Programmed and Evolving Systems
276
12
8.5 H Systems Based on Double Splicing
288
4
8.6 Multisets
292
8
8.7 Universality Results
300
5
8.8 Bibliographical Notes
305
2
9 Splicing Circular Strings
307
14
9.1 Variants of the Splicing Operation for Circular Strings
307
4
9.2 One Further Variant and its Power
311
9
9.3 Bibliographical Notes
320
1
10 Distributed H Systems
321
36
10.1 Splicing Grammar Systems
321
10
10.2 Communicating Distributed H Systems
331
10
10.3 Two-Level Distributed H Systems
341
7
10.4 Time-Varying Distributed H Systems
348
6
10.5 Summary of Computationally Complete H Systems
354
1
10.6 Bibliographical Notes
355
2
11 Splicing Revisited
357
26
11.1 Restricted Splicing; The Non-Iterated Case
357
8
11.2 Replication Systems
365
15
11.3 Bibliographical Notes
380
3
Bibliography
383
16
Index
399