Results 1 
5 of
5
Asynchronous and Maximally Parallel Deterministic Controlled NonCooperative P Systems Characterize NF IN ∪ coNF IN
"... Summary. Membrane systems (with symbol objects) are distributed controlled multiset processing systems. Noncooperative P systems with either promoters or inhibitors (of weight not restricted to one) are known to be computationally complete. In this paper we show that the power of the deterministic ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Summary. Membrane systems (with symbol objects) are distributed controlled multiset processing systems. Noncooperative P systems with either promoters or inhibitors (of weight not restricted to one) are known to be computationally complete. In this paper we show that the power of the deterministic subclass of such systems is computationally complete in the sequential mode, but only subregular in the asynchronous mode and in the maximally parallel mode. 1
P Systems and Topology: Some Suggestions for Research
"... Summary. Lately, some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood just looking at their ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Summary. Lately, some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood just looking at their topology, that is, information flow. This line of research is very promising for several aspects: its results are valid for a broad range of systems based on multiset rewriting; it allows to know the computational power of abstract computing devices without tedious proofs based on simulations; it links computational power to topology and, in this way, it opens a broad range of questions. In this note we summarize the known result on this topic and we list a few suggestions for research together with the relevance of possible outcomes. 1
Academy of Sciences of Moldova
"... Summary. It is known that symport/antiport P systems with two membranes and minimal cooperation can generate any recursively enumerable sets of natural numbers using exactly one superfluous object in the output membrane, where the output membrane is an elementary membrane. In this paper we consider ..."
Abstract
 Add to MetaCart
(Show Context)
Summary. It is known that symport/antiport P systems with two membranes and minimal cooperation can generate any recursively enumerable sets of natural numbers using exactly one superfluous object in the output membrane, where the output membrane is an elementary membrane. In this paper we consider symport/antiport P systems where the output membrane is the skin membrane. In this case we prove an unexpected characterization: symport/antiport P systems with two membranes and minimal cooperation generate exactly the recursively enumerable sets of natural numbers. The question about power of purely symport P systems with two membranes and minimal cooperation where the output membrane is the skin membrane is still open. 1
Decidability of Divergence for Catalytic P Systems
"... Summary. 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 variants of P systems have been proposed and explored. We concentrate on the class of catalytic P systems wit ..."
Abstract
 Add to MetaCart
Summary. 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 variants of P systems have been proposed and explored. We concentrate on the class of catalytic P systems without priorities associated to the rules. We show that the divergence problem (i.e., checking for the existence of an infinite computation) is decidable in such a class of P systems. As a corollary, we obtain an alternative proof of the nonuniversality of deterministic catalytic P systems, an open problem recently solved by Ibarra and Yen. 1
Membrane Computing: A General View
"... We give an informal presentation of the basic ideas, results, and applications of membrane computing, a branch of natural computing inspired by the structure and the functioning of biological cells, cell tissues, or colonies of cells. Membrane computing has given rise to computing models (called P s ..."
Abstract
 Add to MetaCart
(Show Context)
We give an informal presentation of the basic ideas, results, and applications of membrane computing, a branch of natural computing inspired by the structure and the functioning of biological cells, cell tissues, or colonies of cells. Membrane computing has given rise to computing models (called P systems) that are distributed and parallel, which process multisets of objects in compartments defined by membranes. After introducing the main classes of P systems, illustrated with some simple examples, we recall some results, especially those that concern their computing power and computing efficiency: the equivalence with Turing machines for many classes of P systems, and the possibility of designing devices which are capable of solving computationally intractable problems in feasible time. We then briefly discuss some applications (to biology, biomedicine, economics, etc.), giving a typical example to illustrate this research direction. Finally, we report on some software simulators and hardware implementations of P systems that have been developed.