P Colonies of Capacity One and Modularity

Summary. We continue the investigation of P colonies introduced in [8], a class of abstract computing devices composed of independent agents, acting and evolving in a shared environment. The first part is devoted to the P colonies of the capacity one. We present improved allready presented results concerning the computional power of the P colonies. The second part is devoted to the modularity of the P colonies. We deal with dividing the agents into modules.

2D P Colonies and Modelling of Liquid Flow Over the Earth’s Surface

Summary. We continue the investigation of 2D P colonies introduced in [1], a class of abstract computing devices composed of independent agents, acting and evolving in a shared 2D environment where the agents are located. Agents have limited information about the contents of the environment where they can move in four directions.

On the Power of Deterministic and Sequential Communicating P Systems

Abstract. We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in either minimally or maximally parallel mode, are computationally universal. Considering the sequential mode, 2 membranes are shown to characterize the power of partially blind multicounter machines. Next, a characterization of the power of 1-deterministic communicating P systems is given. Finally, we show that the non-deterministic variant in maximally parallel mode is universal already with 1 membrane. These results demonstrate differences in computational power between nondeterminism, 2-determinism and 1-determinism, on one hand, and between sequential, minimally and maximally parallel modes, on the other hand.

An Application of the PCol Automata in Robot Control

Summary. The P colonies were introduced in [6] as a variant of the bio-inspired computational models called membrane systems or P systems. In [2] 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 [1]). This is an accepting computational device based on the very simple computational units. In this paper we combine the approach of the modules in the P colonies and of the PCol automata and we introduce the PCol automaton driven robot.