Buscar
Mostrando ítems 1-6 de 6
Artículo
Tissue P systems with channel states
(Elsevier, 2005)
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 ...
Capítulo de Libro
Cellular solutions to some numerical NP-complete problems: A prolog implementation
(Idea Group Inc., 2005)
This chapter is devoted to the study of numerical NP-complete problems in the framework of cellular systems with membranes, also called P systems (Pǎun, 1998). The chapter presents efficient solutions to the subset sum and ...
Ponencia
Multidimensional descriptional complexity of P systems
(Univ. degli Studi di Milano, 2005)
Membrane Computing is a branch of Natural Computing which starts from the assumption that the processes taking place in the compartmental structure of a living cell can be interpreted as computations. The description of ...
Capítulo de Libro
Characterizing tractability by cell-like membrane systems
(WORLD SCIENTIFIC PUBL CO PTE LTD, 2006)
In this paper we present a polynomial complexity class in the framework of membrane computing. In this context, and using accepting transition P systems, we provide a characterization of the standard computational class P ...
Ponencia
P Systems with Membrane Creation and Rule Input
(Fénix Editora, 2005)
When a uniform family of recognizer P systems is designed to solve a problem, the data of a concrete instance of the problem is usually provided via a multiset which is placed in the so-called input membrane. In this paper ...
Ponencia
Multidimensional Sevilla carpets Associated with P Systems
(Fénix Editora, 2005)
In this paper we address the problem of describing the complexity of the evolution of a P system. This is especially difficult in the case of P systems where the number of membranes in creases along the computation, via ...