Buscar
Mostrando ítems 1-10 de 16
Ponencia
A Short Note on Reversibility in P Systems
(Fénix Editora, 2009)
Membrane computing is a formal framework of distributed parallel comput- ing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible ...
Ponencia
P Systems with Active Membranes and Two Polarizations
(Fénix Editora, 2004)
P systems with active membranes using only two electrical charges and only rules of types (a) and (c) assigned to at most two membranes are shown to be computationally complete { thus improving the previous result of ...
Ponencia
Evolution-Communication P Systems: Time-Freeness
(Fénix Editora, 2005)
Membrane computing is a (biologically motivated) theoretical framework of distributed parallel computing. If symbol-objects are considered, then membrane sys- tems (also called P systems) are distributed multiset processing ...
Ponencia
Dictionary Search and Update by P Systems with String-Objects and Active Membranes
(Fénix Editora, 2009)
Membrane computing is a formal framework of distributed parallel computing. In this paper we implement working with the prefix tree by P systems with strings and active membranes.
Ponencia
On the Power of Deterministic EC P Systems
(Fénix Editora, 2004)
It is commonly believed that a signi¯cant part of the computational power of membrane systems comes from their inherent non-determinism. Re- cently, R. Freund and Gh. P¸aun have considered deterministic P systems, ...
Ponencia
(Ultimately Confluent) Parallel Multiset-Rewriting Systems with Context
(Fénix Editora, 2004)
The aim of this paper is to study the power of parallel multiset- rewriting systems with permitting context (or P systems with non-cooperative rules with promoters). The main result obtained is that if we use promoters of ...
Ponencia
Minimal Cooperation in Symport/Antiport P Systems with One Membrane
(Fénix Editora, 2005)
In this paper we consider symport/antiport P systems with one membrane and rules having at most two objects. Although it has been proved that only finite number sets can be generated by both OP1(sym2) (one-membrane systems ...
Ponencia
P Systems with Minimal Insertion and Deletion
(Fénix Editora, 2009)
In this paper we consider insertion-deletion P systems with priority of deletion over the insertion.We show that such systems with one symbol context-free insertion and deletion rules are able to generate PsRE. If one-symbol ...
Ponencia
P Systems with One Membrane and Symport/Antiport Rules of Five Symbols Are Computationally Complete
(Fénix Editora, 2005)
We consider P systems with only one membrane using symport/antiport rules and prove that any recursively enumerable set of k-dimensional vectors of natural numbers can be generated (accepted) by using at most k + 4 ...
Ponencia
Uniform Solution to QSAT Using Polarizationless Active Membranes
(Fénix Editora, 2006)
It is known that the satisfiability problem (SAT) can be solved a semi- uniform family of deterministic polarizationless P systems with active membranes with non-elementary membrane division. We present a double improvement ...