Buscar
Mostrando ítems 1-10 de 10
Ponencia
Event-Related Outputs of Computations in P Systems
(Fénix Editora, 2005)
We briefly investigate the idea to consider as the result of a computation in a P system the number of steps elapsed between two events produced during the computation. Specifically, we first consider the case when the ...
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
Matter and Anti-Matter in Membrane Systems
(Fénix Editora, 2014)
The concept of a matter object being annihilated when meeting its corresponding anti-matter object is investigated in the context of membrane systems, i.e., of (distributed) multiset rewriting systems applying rules in ...
Ponencia
Matrix Languages, Register Machines, Vector Addition Systems
(Fénix Editora, 2005)
We give a direct and simple proof of the equality of Parikh images of lan- guages generated by matrix grammars with appearance checking with the sets of vectors generated by register machines. As a particular case, we ...
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
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
Two Universality Results for (Mem)Brane Systems
(Fénix Editora, 2006)
We prove that P systems with mate and drip operations and using at most five membranes during any step of a computation are universal. This improves a recent similar result from, where eleven membranes are used. The proof ...