Buscar
Mostrando ítems 1-10 de 11
Ponencia
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
(IEEE Computer Society, 2005)
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursively enumerable sets of vectors of non-negative ...
Ponencia
Universal P Systems: One Catalyst Can Be Suficient
(Fénix Editora, 2013)
Whether P systems with only one catalyst can already be universal, is still an open problem. Here we establish universality (computational completeness) by using speci c variants of additional control mechanisms. At each ...
Ponencia
Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode
(Fénix Editora, 2007)
We investigate the computing power and the efficiency of P systems with active membranes without polarizations, working in the minimally parallel mode. We prove that such systems are computationally complete and able to ...
Ponencia
P Systems with Anti-Matter
(Fénix Editora, 2014)
After a short introduction to the area of membrane computing (a branch of natural computing), we introduce the concept of anti-matter in membrane computing. First we consider spiking neural P systems with anti-spikes, ...
Ponencia
On String Languages Generated by Spiking Neural P Systems
(Fénix Editora, 2006)
We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated ...
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
How to Go Beyond Turing with P Automata: Time Travels, Regular Observer !-Languages, and Partial Adult Halting
(Fénix Editora, 2015)
In this paper we investigate several variants of P automata having in nite runs on nite inputs. By imposing speci c conditions on the in nite evolution of the systems, it is easy to nd ways for going beyond Turing if ...
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
Tissue-like P Systems with Channel-States
(Fénix Editora, 2004)
We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for ...
Ponencia
P Systems: from Anti-Matter to Anti-Rules
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
The concept of a matter object being annihilated when meeting its corresponding anti-matter object is taken over for rule labels as objects and anti-rule labels as the corresponding annihilation counterpart in P systems. ...