08.01.2013 Views

LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

20 Artiom Alhazov, Carlos Martín-Vide, and Linqiang Pan<br />

E ′ . At same time the other copy <strong>of</strong> q exits the membrane, changing its<br />

polarization to neutral.<br />

14. [ 2yi → yi+1] 0<br />

2 , 1 ≤ i ≤ n − 1.<br />

15. [ zi → zi+1]<br />

2 0<br />

, 1 ≤ i ≤ n − 1.<br />

2<br />

16. [ 2ei,j,0 → es(i),s(j),0] 0<br />

2 , 1 ≤ i, j ≤ n, where s(t) =min(t +1,n+2).<br />

17. [ 2gi → gi+1] 0<br />

2 , 0 ≤ i ≤ n − 1.<br />

18. [ 2zn → p] 0<br />

2 .<br />

19. [ 2yn] 0<br />

2 → [ +<br />

2 ] 2 u.<br />

At step n +2k +7,yi,zi (1 ≤ i ≤ n − 1) evolve to yi+1,zi+1, g0 evolves to<br />

g1, zn evolves to p, ei,j,0 (1 ≤ i, j ≤ n) evolvetoes(i),s(j),0, wheres(t) =<br />

min(t +1,n+ 2); at same time, yn exits the membrane where it appears,<br />

changing the polarization <strong>of</strong> that membrane to positive.<br />

20. [ 2ei,n+1,0 → u] +<br />

2 , 1 ≤ i ≤ n +1.<br />

21. [ 2en+1,i,0 → u] +<br />

2 , 1 ≤ i ≤ n +1.<br />

22. [ 2p] +<br />

2 → [ 0<br />

2 ] 2u. In the membranes with label 2 and positive polarization (i.e., the membranes<br />

where yn appear in the last step, this means that vertex vn does not belong<br />

to the corresponding subset), ei,n+1,0 and en+1,i,0 (1 ≤ i ≤ n +1)evolveto<br />

u (which will never evolve again); at the same time, object p exits the membrane,<br />

returning the polarization <strong>of</strong> the membrane to neutral (this makes<br />

possible the use <strong>of</strong> rules <strong>of</strong> types 14, 15, 16, 17, 18, and 19).<br />

In the membranes with label 2 and neutral polarization (i.e., the membranes<br />

where yn do not appear in the last step, this means that vertex vn belongs<br />

to the corresponding subset), using rule <strong>of</strong> type 16, ei,n+1,0 and en+1,i,0<br />

(1 ≤ i ≤ n+1) evolvetoei+1,n+2,0 and en+2,i+1,0 (this means that the edges<br />

ei,n and en,i do not belong to V × (V − A) ∪ (V − A) × V ,whereAis the<br />

corresponding subset).<br />

The rules <strong>of</strong> types 14, 15, 16, 17, 18, 19, 20, 21, and 22 are applied as many<br />

times as possible (in one step rules <strong>of</strong> types 14, 15, 16, 17, 18, and 19, in<br />

the next one rules <strong>of</strong> types 20, 21, and 22, and then we repeat the cycle).<br />

In this way, after 2n steps, a membrane will contain an object en+2,n+2,0<br />

if and only if that membrane contains an edge which does not belong to<br />

V × (V − A) ∪ (V − A) × V ,whereAis the corresponding subset. In the<br />

following steps, we will let the membranes corresponding to a positive answer<br />

send out an object.<br />

23. [ 2gn → gn+1q] 0<br />

2 .<br />

24. [ 2gn+1 → gn+2] 0<br />

2 .<br />

25. [ 2gn+2 → gn+3] −<br />

2 .<br />

26. [ en+2,n+2,0]<br />

2 −<br />

2 → [ +<br />

] 2 2 u.<br />

27. [ 2gn+3] −<br />

2 → [ −<br />

2 ] 2 yes.<br />

28. [ yes] 1 0<br />

1 → [ +<br />

] 1 1 yes.<br />

At step 3n +2k +7,gn evolves to gn+1q. Atstep3n +2k +8,gn+1 evolves<br />

to gn+2, and at the same time, object q exits the membrane, changing the<br />

polarization to negative (using rule <strong>of</strong> type 4). At step 3n +2k +9,inthe

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!