P colonies are abstract computing devices modelling communities of very simple reactive
agents living and acting in a joint shared environment. The concept was motivated by so …

The concept of a matter object being annihilated when meeting its corresponding anti-matter
object is investigated in the context of P systems. Computational completeness can be …

Catalytic P systems and purely catalytic P systems are among the first variants of membrane
systems ever considered in this area. These variants of systems also feature some …

P systems with anti-membranes represent a variant of P systems with anti-matter in which
the concept of annihilation between a matter object and its corresponding anti-matter object …

Computational completeness is known for P systems with two catalysts and purely catalytic
P systems with three catalysts as well as for P systems with one bi-stable catalyst. We …

Catalytic P systems are among the first variants of membrane systems ever considered in
this area. This variant of systems also features some prominent computational complexity …

The integration of symbolic reasoning systems based on logic and connectionist systems
based on the functioning of living neurons is a vivid research area in computer science. In …

Inspired by the programming game Core Wars, we propose in this work a framework and the
organization of king of the hill-style tournaments between P systems. We call these …

Acceptance and recognizability of finite strings by red–green Turing machines are defined
via infinite runs on the input string and the way how to distinguish between red and green …

In this paper we extend the definition of a multiset by allowing elements to have multiplicities
from an arbitrary totally ordered Abelian group instead of only using natural numbers. We …