On the classes of languages characterized by generalized P colony automata

We study the computational power of generalized P colony automata and show how it is influenced by the capacity of the system (the number of objects inside the cells of the colony) and by different types of restrictions on the programs which are allowed to be used by the component cells.