Preface |
|
vii | |
|
Introduction: Membrane Computing -- What It Is and What It Is Not |
|
|
1 | (6) |
|
|
7 | (44) |
|
|
7 | (8) |
|
The Structure of the Plasma Membrane |
|
|
8 | (2) |
|
|
10 | (4) |
|
Cellular Division: Mitosis |
|
|
14 | (1) |
|
|
15 | (1) |
|
Elements of Computability |
|
|
16 | (34) |
|
Basic Notions and Notations |
|
|
17 | (1) |
|
Operations with Strings and Languages |
|
|
18 | (1) |
|
|
19 | (3) |
|
Characterizations, Necessary Conditions |
|
|
22 | (2) |
|
|
24 | (2) |
|
Finite Automata, Turing Machines |
|
|
26 | (3) |
|
|
29 | (10) |
|
On the Difference Between CS and RE |
|
|
39 | (1) |
|
Universal Turing Machines and Type-0 Grammars |
|
|
40 | (2) |
|
Splicing, Insertion-Deletion, Context Adjoining |
|
|
42 | (3) |
|
|
45 | (4) |
|
|
49 | (1) |
|
|
50 | (1) |
|
Membrane Systems with Symbol-Objects |
|
|
51 | (78) |
|
|
51 | (4) |
|
|
55 | (3) |
|
The Power of the Simple Class |
|
|
58 | (6) |
|
|
64 | (21) |
|
|
64 | (6) |
|
Priorities Among the Evolution Rules |
|
|
70 | (1) |
|
|
71 | (3) |
|
|
74 | (3) |
|
The Power of Synchronization |
|
|
77 | (8) |
|
|
85 | (6) |
|
|
91 | (23) |
|
|
91 | (2) |
|
Controlling the Permeability of Membranes |
|
|
93 | (6) |
|
Communication Controlled by Concentration |
|
|
99 | (3) |
|
Creating Rules During the Computation |
|
|
102 | (2) |
|
Using Promoters/Inhibitors |
|
|
104 | (10) |
|
Systems with External Output |
|
|
114 | (11) |
|
|
125 | (4) |
|
Trading Evolution for Communication |
|
|
129 | (32) |
|
Systems with Symport/Antiport |
|
|
130 | (3) |
|
Computational Universality |
|
|
133 | (8) |
|
Controls on the Use of Rules |
|
|
141 | (3) |
|
Following the Traces of Objects |
|
|
144 | (9) |
|
|
153 | (6) |
|
|
159 | (2) |
|
|
161 | (74) |
|
Rewriting Membrane Systems |
|
|
162 | (18) |
|
Some Variants and Their Power |
|
|
180 | (31) |
|
|
181 | (1) |
|
|
181 | (5) |
|
Conditional Communication |
|
|
186 | (13) |
|
|
199 | (9) |
|
|
208 | (3) |
|
Splicing Membrane Systems |
|
|
211 | (12) |
|
Contextual Membrane Systems |
|
|
223 | (3) |
|
Insertion--Deletion Membrane Systems |
|
|
226 | (5) |
|
|
231 | (4) |
|
|
235 | (36) |
|
|
236 | (2) |
|
Using Symport/Antiport Rules |
|
|
238 | (11) |
|
Neural-like Networks of Membranes |
|
|
249 | (20) |
|
|
249 | (7) |
|
|
256 | (11) |
|
The Computational Efficiency |
|
|
267 | (2) |
|
|
269 | (2) |
|
|
271 | (58) |
|
Complexity Classes for Membrane Systems |
|
|
271 | (2) |
|
|
273 | (28) |
|
Solving SAT in Linear Time |
|
|
281 | (5) |
|
Solving the Hamiltonian Path Problem |
|
|
286 | (4) |
|
|
290 | (8) |
|
Is Membrane Division Necessary? |
|
|
298 | (3) |
|
|
301 | (20) |
|
|
311 | (5) |
|
|
316 | (2) |
|
The Case of String-Objects |
|
|
318 | (3) |
|
|
321 | (2) |
|
Using Pre-computed Resources |
|
|
323 | (4) |
|
|
327 | (2) |
|
Further Technical Results |
|
|
329 | (38) |
|
|
329 | (11) |
|
|
340 | (4) |
|
A Representation of Context-free Languages |
|
|
344 | (4) |
|
Valuating the String--Objects |
|
|
348 | (3) |
|
Systems with Enhanced Membrane Handling |
|
|
351 | (3) |
|
Brief Excursion Through the Literature |
|
|
354 | (13) |
|
Generalized Sequential Membrane Systems |
|
|
354 | (3) |
|
|
357 | (1) |
|
Membrane Systems and Stream X-machines |
|
|
357 | (2) |
|
Membrane Systems and Ambient Calculus |
|
|
359 | (2) |
|
A Direct Construction of a Universal System |
|
|
361 | (2) |
|
|
363 | (4) |
|
(Attempts to Get) Back to Reality |
|
|
367 | (32) |
|
Getting Closer to the Cell by Energy Accounting |
|
|
367 | (6) |
|
Getting Closer to the Cell by Gemmation |
|
|
373 | (2) |
|
Getting Closer to the Cell: Bilayer Membranes |
|
|
375 | (4) |
|
In Silico Implementations |
|
|
379 | (5) |
|
Artificial Life Applications |
|
|
384 | (8) |
|
A Simulation of Photosynthesis |
|
|
392 | (7) |
Open Problems |
|
399 | (2) |
Universality Results |
|
401 | (2) |
References |
|
403 | (14) |
Index |
|
417 | |