Buscar
Mostrando ítems 1-3 de 3
Artículo
Computational efficiency of dissolution rules in membrane systems
(Taylor and Francis, 2006)
Trading (in polynomial time) space for time in the framework of membrane systems is not sufficient to efficiently solve computationally hard problems. On the one hand, an exponential number of objects generated in ...
Capítulo de Libro
Available Membrane Computing Software
(Springer, 2006)
The simulation of a P system with current computers is a quite com-plex task. P systems are intrinsically nondeterministic computational devices and therefore their computation trees are di±cult to store and handle with ...
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 ...