09.09.2014 Views

13th International Conference on Membrane Computing - MTA Sztaki

13th International Conference on Membrane Computing - MTA Sztaki

13th International Conference on Membrane Computing - MTA Sztaki

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

(Tissue) P systems with decaying objects<br />

of the cell number, i.e., instead of writing (w, 1) we simply write w and instead<br />

of writing (E : (x 1 , 1) → (y 1 , 1)) we may write E : x 1 → y 1 ; moreover, if E is a<br />

c<strong>on</strong>diti<strong>on</strong> which is always fulfilled, we may <strong>on</strong>ly write x 1 → y 1 .<br />

Example 2. C<strong>on</strong>sider the P systems<br />

Π (d) = (1, {s, a} , {a} , s, {s → as, s → λ} , 1)<br />

for d > 1. Then the <strong>on</strong>ly computati<strong>on</strong>s c<strong>on</strong>sist of applying n times the rule<br />

s → as and finally ending up with applying the rule s → λ. For n = 0, we get<br />

s [d] =⇒ (Π(d) [d] ,ϑ)<br />

λ, for 1 ≤ n ≤ d, we obtain the sequence of c<strong>on</strong>figurati<strong>on</strong>s<br />

s [d] =⇒ n (Π(d) [d] ,ϑ) a[d−n+1] . . . a [d] s [d] =⇒ (Π(d) [d] ,ϑ) a[d−n] . . . a [d−1] ,<br />

whereas for n > d we get<br />

s [d] =⇒ d+1<br />

(Π(d) [d] ,ϑ) a[1] a [2] . . . a [d] s [d]<br />

=⇒ ∗ (Π(d) [d] ,ϑ) a[1] a [2] . . . a [d] s [d] =⇒ (Π(d) [d] ,ϑ) a[1] . . . a [d−1] .<br />

Hence, in sum we obtain<br />

N [d] (Π (d) , ϑ, γ, ρ) = {n | 0 ≤ n < d} ,<br />

for ρ ∈ {N, T } ∪ {−l | l ∈ N} and any of the transiti<strong>on</strong> modes ϑ as defined in the<br />

preceding secti<strong>on</strong> as well as with γ denoting total halting, partial halting (the<br />

whole rule set forms the <strong>on</strong>ly partiti<strong>on</strong>), or halting with final states (defined by<br />

the regular set of multisets {a} ◦ , which in fact means the same as taking ρ = T ).<br />

Therefore, the family of P systems Π (d) with d ∈ N forms a very simple infinite<br />

hierarchy with respect to the decay d in any of these cases.<br />

Example 3. Let M be a finite subset of T ◦ . C<strong>on</strong>sider the P system<br />

Π (M) = (1, {s} ∪ T, T, s, {s → w | w ∈ M} , 1) .<br />

Obviously, P s [d] (Π (M) , ϑ, γ, ρ) = M for ρ ∈ {N, T } ∪ {−l | l ∈ N} and any<br />

of the transiti<strong>on</strong> modes ϑ as defined in the preceding secti<strong>on</strong> as well as with<br />

γ ∈ {H, h, F }; hence, for all n, d ≥ 1,<br />

P sO ∗<br />

[d] C n (ϑ, γ, ρ) [ncoo] ⊇ P sF IN,<br />

where ncoo indicates (the use of) n<strong>on</strong>cooperative rules.<br />

Example 4. Let G = (N, T, P, S) be a regular grammar (without loss of generality,<br />

we assume G to be reduced, i.e., from every n<strong>on</strong>terminal symbol a terminal<br />

string can be derived). C<strong>on</strong>sider the P system<br />

Π (G) = (1, N ∪ T, T, S, R, 1)<br />

23

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

Saved successfully!

Ooh no, something went wrong!