Miroslav Langer

Modularity in p colonies with checking rules

P colony, which was introduced in [9], is an abstract computing device composed of independent agents, acting and evolving in a shared environment. In this paper we bring a new view to investigation of the behavior of the P colonies. The first part of the paper focuses on the modularity of the P colonies with checking rules. We group the agents into modules with specific function. In the second part of the paper we introduce improved results concerning the computational power of the P colonies with capacity one.

Small (purely) catalytic P systems simulating register machines

The paper contributes to the topic of (purely) catalytic P systems. Catalytic P systems represent the original and likely the simplest class of membrane computing models. It is known that (purely) catalytic P systems with two (respectively three) catalysts and one membrane can simulate any Minsky register machine and, hence, they are computationally complete. However, the problem of minimal size of such a universal catalytic P system remains open for about ten years. We improve known results about small catalytic P systems simulating register machines in three different modes (generating, accepting, computing functions). Together with some specific universal register machine [7], one could eventually construct a small universal catalytic P system. As a consequence, we also improve the previous construction of a minimal catalytic P system generating a non-semilinear set, diminishing the number of necessary rules from 29 to 24.

The Abilities of P Colony Based Models in Robot Control

P colonies were introduced in 2004 (see [10]) as an abstract computing device composed of independent single membrane agents, reactively acting and evolving in a shared environment. Each agent is equipped with a set of rules which are structured into simple programs. There are some models based on from original P colony. In most cases, models are equipped with such components which are associated with the environment. This is the case of Pcol automaton too. The agents work not only with environment but also with an input tape. We use this two theoretical computational devices to build complex robot controllers. In this paper we introduce simple controllers; the first one is used for fulfilling instructions and the other one for passing the maze using right-hand rule. We followed two different approaches and ideas and we present the obtained results in this paper.

Modelling of Surface Runoff Using 2D PäColonies

We continue the investigation of 2D P colonies introduced as 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. In this paper we continue the research of modelling surface runoff in 2D P colonies. We have added information about flow direction and amount of water in sinks (places without runoff, lakes,...) to the simulation environment. The data from the simulation is compared with the data generated by simulation model of water erosion SIMWE.

POSITIONED AGENTS IN ECO-GRAMMAR SYSTEMS

Positioned eco-grammar systems (PEG systems, for short) were introduced in [9]. Motivation of introducing positioned eco-grammar systems is an attempt to describe interplay between evolving environment and community of agents living in this environment whereas we focus on the positions of agents in the environment. PEG systems bring a new view to investigating interplay between community of agents and environment. Our approach allows to study local changes in evolving environment caused by agents moreover the position of the agent is strictly given by special symbol and we are able to predict its behavior and control the evolution of environment as well. In this paper we compare generative power of the PEG systems with three types of pure (regulated) grammars.

P Colonies of Capacity One and Modularity

In this paper, the authors continue the investigation of P colonies introduced in Kelemen, KelemenovAi, and Paun (2004). This paper examines 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. The authors present improved results concerning the computational power of the P colonies with capacity one and without using checking programs. The second part of the paper examines the modularity of the P colonies. The authors then divide the agents into modules.

On positioned eco-grammar systems and pure grammars of type 0

In this paper we extend our results given in [5] where we compared PEG systems with pure regulated context-free grammars (see [3]). We will show that the family of languages generated by the pure grammars of type 0 is a proper subclass of the family of languages generated by positioned eco-grammar systems. We present a way how to coordinate parallel behavior of agents with one-sided context in a PEG system in order to simulate the derivation step in a pure grammar of type 0 determined by a single rule which replaces an arbitrarily long string by another one. Related results concerning PEG systems and pure languages can be found in [6].