CIENCIALOVÁ , Lucie

In this work, we continue our research in the eld of string processing mem- brane systems - APCol systems. We focus on a relation of APCol systems with PM colonies - colonies whose agents can only perform point mutation transformations of the common string, in a vicinity of the agent. The second part is devoted to a connection of APCol systems...

We study two variants of P colonies with initial content of P colony and so called passive environment: P colonies with two objects inside each agent that can only consume or generate objects, and P colonies with one object inside each agent using rewriting and communication rules. We show that the rst kind of P colonies with one consumer...

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.

We continue the investigation of P colonies introduced in, a class of abstract computing devices composed of independent agents, acting and evolving in a shared environment. The rst 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...

In this paper, we investigate a possibility of Grey wolf optimization algo- rithm simulation by 2D P colonies. We introduce a new kind of 2D P colony equipped with a blackboard. It is used by agents to store information that is reachable by all the agents from every place in the environment.

P colonies are abstract computing devices modeling communities of very simple reactive agents living and acting in a joint shared environment which is given with a multiset of objects. Reaction systems were proposed as a computing device, components of which represent basic chemical reactions that take place in shared environment given with a...

In this paper we study P colonies where the environment is given as a string. These variants, called automaton-like P systems or APCol systems, behave like automata: during functioning, the agents change their own states and process the symbols of the string. We develop the concept of APCol systems by introducing the notion of their generating...

Two proofs have been shown for P systems with active membranes in previ- ously published papers, demonstrating that these P systems can solve in polynomial time exactly the class of problems PSPACE. Consequently, these P systems are equivalent (up to a polynomial time reduction) to Second Machine Class models as the alternating Turing machine...

In this paper we introduce and study P colonies where the environment is given as a string. These variants of P colonies, called Automaton-like P systems or APCol systems, behave like automata: during functioning, the agents change their own states and process the symbols of the string. After introducing the concept of APCol systems, we examine...

We introduce a new acceptance mode for APCol systems (Automaton-like P colonies), variants of P colonies where the environment of the agents is given by a string and during functioning the agents change their own states and process the string similarly to automata. In case of the standard variant, the string is accepted if it can be reduced to...

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.

We introduce the concept of a P colony automaton, an automata-like con- struct combining properties of finite automata and P colonies. We present some preliminary results on the accepting power of several variants of these extremely simple language recognizing devices, and propose problems for future research.

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...

P colonies were introduced in 2004 (see [7]) as an abstract computing device composed of independent single membrane agents, reactively acting and evolving in a shared environment. Each agent is equip with set of rules which are structured into simple programs. We use this very simple symbol processing computational device to build...

In this paper we continue our investigations in APCol systems (Automatonlike P colonies), variants of P colonies where the environment of the agents is given by a string and the functioning of the system resembles to the functioning of standard nite automaton. We rst deal with the concept of determinism in these systems and...