Buscar
Mostrando ítems 11-20 de 21
Ponencia
A Toolbox for Simpler Active Membrane Algorithms
(Fénix, 2016)
We show that recogniser P systems with active membranes can be augmented with a priority over their set of rules and any number of membrane charges without loss of generality, as they can be simulated by standard P ...
Ponencia
Purely Catalytic P Systems over Integers and Their Generative Power
(Fénix, 2016)
We further investigate the computing power of the recently introduced P systems with Z-multisets (also known as hybrid sets) as generative devices. These systems apply catalytic rules in the maximally parallel way, even ...
Ponencia
Simulating the Fredkin Gate with Energy-Based P Systems
(Fénix Editora, 2004)
Reversibility plays a fundamental role when the possibility to per- form computations with minimal energy dissipation is considered. Many pa- pers on reversible computation have appeared in literature: the most famous are ...
Ponencia
On the Computational Power of Spiking Neural P Systems
(Fénix Editora, 2007)
In this paper we study some computational properties of spiking neural P systems. In particular, we show that by using nondeterminism in a slightly extended version of spiking neural P systems it is possible to solve in ...
Ponencia
Monodirectional P Systems
(Fénix Editora, 2015)
We investigate the in uence that the ow of information in membrane systems has on their computational complexity. In particular, we analyse the behaviour of P systems with active membranes where communication only ...
Ponencia
Complete Problems for a Variant of P Systems with Active Membranes
(Fénix Editora, 2010)
We identify a family of decision problems that are hard for some complexity classes defined in terms of P systems with active membranes working in polynomial time. Furthermore, we prove the completeness of these problems ...
Ponencia
Constant-Space P Systems with Active Membranes
(Fénix Editora, 2014)
We continue the investigation of the computational power of space- constrained P systems. We show that only a constant amount of space is needed in order to simulate a polynomial-space bounded Turing machine. Due to this ...
Ponencia
Sequential P Systems with Unit Rules and Energy Assigned to Membranes
(Fénix Editora, 2004)
We introduce a new variant of membrane systems where the rules are directly assigned to membranes (and not to the regions as this is usually observed in the area of membrane systems) and, moreover, every membrane carries ...
Ponencia
Elementary Active Membranes Have the Power of Counting
(Fénix Editora, 2011)
We prove that uniform families of P systems with active membranes operat- ing in polynomial time can solve the whole class of PP decision problems, without using nonelementary membrane division or dissolution rules. This ...
Ponencia
Semilinear Sets, Register Machines, and Integer Vector Addition (P) Systems
(Fénix, 2016)
In this paper we consider P systems working with multisets with integer multiplicities. We focus on a model in which rule applicability is not in uenced by the contents of the membrane. We show that this variant is ...