Buscar
Mostrando ítems 1-9 de 9
Ponencia
A Characterization of PSPACE with Antimatter and Membrane Creation
(Fénix Editora, 2015)
The use of negative information provides a new tool for exploring the limits of P systems as computational devices. In this paper we prove that the combination of antimatter and annihilation rules (based on the annihilation ...
Ponencia
Studying the Chlorophyll Fluorescence in Cyanobacteria with Membrane Computing Techniques
(Fénix Editora, 2013)
In this paper, we report a pioneer study of the decrease in chlorophyll uorescence produced by the reduction of MTT (a dimethyl thiazolyl diphenyl tetrazolium salt) monitored using an epi uorescence microscope coupled ...
Ponencia
The Pole Balancing Problem with Enzymatic Numerical P Systems
(Fénix Editora, 2015)
Pole balancing is a control benchmark widely used in engineering. It involves a pole a xed to a cart via a joint which allows movement along a single axis. In this problem, the movement of the cart is restricted to the ...
Ponencia
Solving SAT with Antimatter in Membrane Computing
(Fénix Editora, 2015)
The set of NP-complete problems is split into weakly and strongly NP- complete ones. The di erence consists in the in uence of the encoding scheme of the input. In the case of weakly NP-complete problems, the intractability ...
Ponencia
On The Semantics of Annihilation Rules in Membrane Computing
(Fénix Editora, 2015)
It is well known that polarizationless recognizer P systems with active membranes, without dissolution, with division of elementary and non-elementary membranes, with antimatter and matter/antimatter annihilation rules ...
Ponencia
Self-constructing Recognizer P Systems
(Fénix Editora, 2014)
Usually, the changes produced in the membrane structure of a P system are considered side effects. The output of the computation is encoded as a multiset placed in a specific region and the membrane structure in the ...
Ponencia
Antimatter as a Frontier of Tractability in Membrane Computing
(Fénix Editora, 2014)
It is well known that the polynomial complexity class of recognizer polarizationless P systems with active membranes, without dissolution and with division for elementary and non-elementary membranes is exactly the ...
Ponencia
Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques
(Fénix Editora, 2014)
In Membrane Computing, the solution of a decision problem X belonging to the complexity class P via a polynomially uniform family of recognizer P systems is trivial, since the polynomial encoding of the input can involve ...
Ponencia
Rete Algorithm for P System Simulators
(Fénix Editora, 2013)
The Rete algorithm is a well-known algorithm in rule-based production systems which builds directed acyclic graphs that represent higher-level rule sets. This allows the rule-based systems to avoid complete re-evaluation ...