In this book the authors present an alternative set theory dealing with a more relaxed notion
of infiniteness, called finitely supported mathematics (FSM). It has strong connections to the …

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 …

We show multiple ways of how to simulate R systems by non-cooperative P systems with
atomic control by promoters and/or inhibitors, or with matter/antimatter annihilation rules …

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 …

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, it is investigated how different features of membrane systems can be simulated
by the boundary rule application. Firstly, it is discussed how the effect of maximally parallel …

In this paper we prove that uniform families of P systems with active membranes and using
antimatter characterize the complexity class P when polarizations, dissolution rules and …

We study generalized multisets (multisets that allow possible negative multiplicities) both in
the Zermelo-Fraenkel framework and in the finitely supported mathematics. We extend the …