In this paper we consider P systems with linear membrane structures (only one membrane is elementary) with at most one object. We raise and attack the question about the computational power of such systems, depending on the number of membrane labels, kinds of rules used, and some other possible restrictions
It is known that the satisfiability problem (SAT) can be efficiently solved by a uniform family of P...
Classical membrane systems with symport/antiport rules observe the con- servation law, in the sense...
We present an operational semantics of the membrane systems, using an appropriate notion of configur...
Summary. In this paper we consider P systems with linear membrane structures (only one membrane is e...
We improve, by using register machines, some existing universality results for specific models of P...
We improve, by using register machines, some existing universality results for specific models of P ...
The aim of this paper is to study the computational power of P systems with one active membrane wit...
This paper proposes a new model of P systems where the rules are activated by objects present in th...
We consider P systems with only one membrane using symport/antiport rules and prove that any recurs...
A current research topic in membrane computing is to find more realistic P systems from a biological...
Membrane computing is an emerging research field that belongs to the more general area of molecular ...
In this paper we consider symport/antiport P systems with one membrane and rules having at most two...
AbstractWe look at a restricted model of a communicating P system, called RCPS, whose environment do...
In P systems with gemmation of mobile membranes were ex- amined. It was shown that (extended) syste...
AbstractA current research topic in membrane computing is to find more realistic P systems from a bi...
It is known that the satisfiability problem (SAT) can be efficiently solved by a uniform family of P...
Classical membrane systems with symport/antiport rules observe the con- servation law, in the sense...
We present an operational semantics of the membrane systems, using an appropriate notion of configur...
Summary. In this paper we consider P systems with linear membrane structures (only one membrane is e...
We improve, by using register machines, some existing universality results for specific models of P...
We improve, by using register machines, some existing universality results for specific models of P ...
The aim of this paper is to study the computational power of P systems with one active membrane wit...
This paper proposes a new model of P systems where the rules are activated by objects present in th...
We consider P systems with only one membrane using symport/antiport rules and prove that any recurs...
A current research topic in membrane computing is to find more realistic P systems from a biological...
Membrane computing is an emerging research field that belongs to the more general area of molecular ...
In this paper we consider symport/antiport P systems with one membrane and rules having at most two...
AbstractWe look at a restricted model of a communicating P system, called RCPS, whose environment do...
In P systems with gemmation of mobile membranes were ex- amined. It was shown that (extended) syste...
AbstractA current research topic in membrane computing is to find more realistic P systems from a bi...
It is known that the satisfiability problem (SAT) can be efficiently solved by a uniform family of P...
Classical membrane systems with symport/antiport rules observe the con- servation law, in the sense...
We present an operational semantics of the membrane systems, using an appropriate notion of configur...