KELEMENOVÁ , Alice

We study two very simple variants of P colonies: systems with only one object inside the cells, and systems with insertion-deletion programs, so called P colonies with senders and consumers. We show that both of these extremely simple types of systems are able to compute any recursively enumerable set of vectors of non-negative integers.

The P colonies were introduced in as a variant of the bio-inspired com- putational models called membrane systems or P systems. In we divided agents into the groups according the function they provide; we introduced the modularity on the P colonies. PCol automata are an extension of the P colonies by the tape (see). This is an accepting...