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

Create successful ePaper yourself

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

The efficiency of tissue P systems with cell separati<strong>on</strong> relies <strong>on</strong> the envir<strong>on</strong>ment<br />

An instantaneous descripti<strong>on</strong> or a c<strong>on</strong>gurati<strong>on</strong> at any instant of a tissue<br />

P system with cell separati<strong>on</strong> is described by all multisets of objects over Γ<br />

associated with all the cells present in the system, and the multiset of objects<br />

over Γ − E associated with the envir<strong>on</strong>ment at that moment. Recall that there<br />

are innitely many copies of objects from E in the envir<strong>on</strong>ment, and hence this<br />

set is not properly changed al<strong>on</strong>g the computati<strong>on</strong>. The initial c<strong>on</strong>gurati<strong>on</strong><br />

is (M 1 , · · · , M q ; ∅). A c<strong>on</strong>gurati<strong>on</strong> is a halting c<strong>on</strong>gurati<strong>on</strong> if no rule of the<br />

system is applicable to it.<br />

Let us x a tissue P system with cell separati<strong>on</strong> Π. We say that c<strong>on</strong>gurati<strong>on</strong><br />

C 1 yields c<strong>on</strong>gurati<strong>on</strong> C 2 in <strong>on</strong>e transiti<strong>on</strong> step, denoted by C 1 ⇒ Π C 2 , if we can<br />

pass from C 1 to C 2 by applying the rules from R following the previous remarks.<br />

A computati<strong>on</strong> of Π is a (nite or innite) sequence of c<strong>on</strong>gurati<strong>on</strong>s such that:<br />

1. the rst term of the sequence is the initial c<strong>on</strong>gurati<strong>on</strong> of the system;<br />

2. each n<strong>on</strong>-initial c<strong>on</strong>gurati<strong>on</strong> of the sequence is obtained from the previous<br />

c<strong>on</strong>gurati<strong>on</strong> by applying rules of the system in a maximally parallel manner<br />

with the restricti<strong>on</strong>s previously menti<strong>on</strong>ed; and<br />

3. if the sequence is nite (called halting computati<strong>on</strong>) then the last term of the<br />

sequence is a halting c<strong>on</strong>gurati<strong>on</strong>.<br />

All computati<strong>on</strong>s start from an initial c<strong>on</strong>gurati<strong>on</strong> and proceed as stated above;<br />

<strong>on</strong>ly halting computati<strong>on</strong>s give a result, which is encoded by the objects present<br />

in the output cell i out in the halting c<strong>on</strong>gurati<strong>on</strong>.<br />

If C = {C t } t

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

Saved successfully!

Ooh no, something went wrong!