Buscar
Mostrando ítems 1-4 de 4
Artículo
A Framework for Complexity Classes in Membrane Computing
(Elsevier, 2009)
The purpose of the present work is to give a general idea about the existing results and open problems concerning the study of complexity classes within the membrane computing framework. To this aim, membrane systems ...
Artículo
P Systems Computing the Period of Irreducible Markov Chains
(Agora University of Oradea, 2009)
It is well known that any irreducible and aperiodic Markov chain has exactly one stationary distribution, and for any arbitrary initial distribution, the se- quence of distributions at time n converges to the stationary ...
Artículo
Membrane division, restricted membrane creation and object complexity in P systems
(Taylor and Francis, 2006)
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 ...
Artículo
P systems with input in binary form
(WORLD SCIENTIFIC PUBL CO PTE LTD, 2006)
Current P systems which solve NP-complete numerical problems represent the instances of the problems in unary notation. However, in classical complexity theory, based upon Turing machines, switching from binary to unary ...