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.

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

10. [ 2b] +<br />

2 → [ 0<br />

2 ] 2u. At step n +1, h0 evolves to h ′ 0 , and at the same time one copy <strong>of</strong> q exits the<br />

membrane, changing its polarization to negative. At step n +2, ti evolves to<br />

abt ′ i , and at the same time the other copy <strong>of</strong> q exits the membrane, changing<br />

its polarization to neutral. At step n +3, onecopy<strong>of</strong>aexits the membrane,<br />

changing its polarization to positive. At step n +4,h ′ 0 evolves to h1, andat<br />

thesametimeonecopy<strong>of</strong>bexits the membrane, returning its polarization<br />

to neutral (this makes possible the use <strong>of</strong> rules <strong>of</strong> types 7 and 9).<br />

The rules <strong>of</strong> types 7, 8, 9, and 10 are applied as many times as possible (in<br />

one step rules <strong>of</strong> types 7 and 9, in the next one rules <strong>of</strong> types 8 and 10, and<br />

then we repeat the cycle). Clearly, at step n +2+2k, a membrane contains<br />

object hk if and only if the cardinality <strong>of</strong> the corresponding subset is at<br />

least k. Atstepn +3+2k, in the membranes whose corresponding subsets<br />

have cardinality more than k, hk evolves to h ′ k , and one copy <strong>of</strong> a changes<br />

their polarization to positive. These membranes will no longer evolve, as no<br />

further rule can be applied to them. In the membranes whose corresponding<br />

subsets have cardinality exactly k, hk evolves to h ′ k , and their polarization<br />

remains neutral, because there is no copy <strong>of</strong> a which can be used. We will<br />

begin the next phase <strong>of</strong> computation with the rule <strong>of</strong> type 11 – checking<br />

whether a subset with cardinality k is a vertex cover.<br />

11. [ 2h ′ 0<br />

k → qqg1] 2 .<br />

12. [ 2t ′ i → ei1<br />

−<br />

···eil ] 2 ,1≤ i ≤ n, andvertexviis adjacent to edges ei1 ···eil .<br />

At step n +4+2k, in the membranes with label 2 and polarization 0, h ′ k<br />

evolves to qqg1.Atstepn+5+2k,onecopy<strong>of</strong>qexits the membrane, changing<br />

its polarization to negative. At step n +6+2k, in parallel t ′ i (1 ≤ i ≤ n)<br />

evolves to ei1 ···eil , and at same time the other copy <strong>of</strong> q exits the membrane,<br />

changing its polarization to neutral. After completing this step, if there is at<br />

least one membrane with label 2 which contains all symbols e1, ··· ,em, then<br />

this means that the subset corresponding to that membrane is a vertex cover<br />

<strong>of</strong> cardinality k. Otherwise (if in no membrane we get all objects e1, ··· ,em),<br />

there exists no vertex cover <strong>of</strong> cardinality k. In the following steps, we will<br />

“read” the answer, and send a suitable signal out <strong>of</strong> the system. This will be<br />

done by the following rules.<br />

13. [ 2gi → g ′ 0<br />

ip] 2 , 1 ≤ i ≤ m.<br />

14. [ 2e1] 0<br />

2 → [ +<br />

2 ] 2 u.<br />

Object gi evolves to g ′ ip. At the same time for all subsets <strong>of</strong> cardinality k, we<br />

check whether or not e1 is present in each corresponding membrane. If this is<br />

the case, then one copy <strong>of</strong> e1 exits the membrane where it is present, evolving<br />

to u, and changing in this way the polarization <strong>of</strong> that membrane to positive<br />

(the other copies <strong>of</strong> e1 will immediately evolve to e0, which will never evolve<br />

again). The membranes which do not contain the object e1 remain neutrally<br />

charged and they will no longer evolve, as no further rule can be applied to<br />

them.<br />

15. [ 2ei → ei−1] +<br />

2 , 1 ≤ i ≤ m.<br />

16. [ 2g ′ i , 1 ≤ i ≤ m.<br />

→ gi+1] +<br />

2

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

Saved successfully!

Ooh no, something went wrong!