Here we study the computational power of different variants of sequential P-systems. Initially we look at cooperative systems operating on symbol objects and ...

Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fash- ion. However, in some cases a sequential model ...

We show two types of results: there are sequential P systems that are universal and sequential P systems that are nonuniversal. In particular, both ...

Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may ...

Here we study the computational power of different variants of sequential P-systems. Initially we look at cooperative systems operating on symbol objects and ...

Here we study the computational power of different variants of sequential P systems. Initially we look at cooperative systems operating on symbol objects and ...

The computational power of different variants of sequential P systems is studied: cooperative systems operating on symbol objects and without prioritized ...

Aug 23, 2006 · We show two types of results: there are sequential P systems that are universal and sequential P systems that are nonuniversal. In particular, ...

These results demonstrate differences in computational power between nondeterminism, 2-determinism and 1-determinism, on one hand, and between sequential, ...

Abstract. We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic com-.