The original model of P systems with symbol objects introduced by Păun was shown to be
computationally universal, provided that catalysts and priorities of rules are used. By …

P systems with active membranes are usually defined as devices hierarchically structured
that evolve through rewriting rules. These rules take the inspiration on the chemical …

In rewriting P systems, that is P systems using structured strings instead of atomic symbols,
rules can be applied in parallel on all strings, but a single rule at a time can be applied on …

Tissue P systems with evolutional symport/antiport rules are a variant of tissue P systems,
where objects are communicated through regions by symport/antiport rules, and objects may …

This is a brief overview of membrane computing, at about five years since this area of natural
computing has been initiated. One informally introduces the basic ideas and the basic …

We look at 1-region membrane computing systems which only use rules of the form Ca→
Cv, where C is a catalyst, a is a noncatalyst, and v is a (possibly null) string of noncatalysts …

This chapter discusses the key concepts in Membrane Computing, with some examples
illustrating their usage, the main theoretical developments, by pointing at some of the most …

We look at 1-region membrane computing systems which only use rules of the form Ca→
Cv, where C is a catalyst, a is a noncatalyst, and v is a (possibly null) string of noncatalysts …

P systems are a biologically inspired model introduced by Gheorghe Păun with the aim of
representing the structure and the functioning of the cell. Since their introduction, several …

The generative capability of several variants of P systems with symport/antiport is studied via
the simulation of counter automata. This leads to the reduction of the complexity, expressed …