Buscar
Mostrando ítems 1-5 de 5
Artículo
P automata revisited
(Elsevier, 2012)
We continue here the investigation of P automata, in their non-extended case, a class of devices which characterize non-universal family of languages. First, a recent conjecture is confirmed: any recursively enumerable ...
Artículo
Solving Common Algorithmic Problem by Recognizer Tissue P Systems
(Romanian Academy, 2012)
Common Algorithmic Problem is an optimization problem, which has the nice property that several other NP-complete problems can be reduced to it in linear time. In this work, we deal with its decision version in the ...
Artículo
Comparing simulation algorithms for multienvironment probabilistic P systems over a standard virtual ecosystem
(Springer, 2012)
Membrane Computing has recently proved to be a suitable framework for addressing the modelling of dynamical biological systems in general, and ecosystems in particular. Due to the inherent randomness and uncertainty in ...
Artículo
Improving GPU Simulations of Spiking Neural P Systems
(Romanian Academy, 2012)
In this work we present further extensions and improvements of a Spiking Neural P system (for short, SNP systems) simulator on graphics processing units (for short, GPUs). Using previous results on representing SNP system ...
Artículo
An infinite hierarchy of languages defined by dP systems
(Elsevier, 2012)
Here, we continue the study of the recently introduced dP automata. They are symport/antiport P systems consisting of a number of components, each one accepting a string, and working together in recognizing the concatenation ...