P automata are automata-like accepting variants of membrane systems or P systems. The
generic model is an antiport P system where the input sequences are distinguished as …

Bioinspired computation models and mechanisms are widely used in various applications,
both in theoretical and practical level. Membrane Computing, a branch of Natural …

In this paper we discuss P automata, ie, accepting P systems, using in most cases only
communication rules. We briefly describe the most important variants of these systems and …

In the standard definition of a P system, a computation step consists of a parallel application
of a “maximal” set of nondeterministically chosen rules. Referring to this system as a parallel …

We study the computational power of generalized P colony automata and show how it is
influenced by the capacity of the system (the number of objects inside the cells of the colony) …

An important open problem in the area of membrane computing is whether there is a model
of P systems for which the nondeterministic version is strictly more powerful than the …

We give “syntactic''characterizations of context-sensitive languages (CSLs) in terms of some
restricted models of symport/antiport P systems. These are the first such characterizations of …

We investigate genPCol automata with input map**s that can be realized through the
application of finite transducers to the string representations of multisets. We show that using …

To study systems whose dynamics changes with time, an extension of timed P systems is
introduced in which evolution rules may vary with time. The proposed model is a timed …

We introduce a restricted model of a one-membrane symport/antiport system, called
bounded S/A system. We show the following: 1. A language L⊆a_1^*...a_k^* is accepted by …