Buscar
Mostrando ítems 1-10 de 14
Capítulo de Libro
Graphical Modeling of Higher Plants Using P Systems
(Springer, 2006)
L systems have been widely used to model and graphically represent the growth of higher plants [20]. In this paper we continue developing the framework introduced in [21], which make use of the topology of membrane ...
Ponencia
Complexity Classes in Cellular Computing with Membranes
(2003)
In this paper we introduce the complexity class PMC∗ F of all decision problems solvable in polynomial time by a family of P systems belonging to a prefixed class of recognizer membrane systems, F.
Capítulo de Libro
Computationally Hard Problems Addressed Through P Systems
(Springer, 2006)
In this chapter we present a general framework to provide efficient solutions to decision problems through families of cell-like membrane systems constructed in a semi-uniform way (associating with each instance of the ...
Artículo
Modelos de computación celular con membranas
(SEMA, 2004)
Capítulo de Libro
Formal Verification of Programs in Molecular Models with Random Access Memory
(Fénix Editorial, 2005)
Formal verification of molecular programs is a first step towards their automatic processing by means of reasoning systems (ACL2, PVS, etc). In this paper a systematic method to establish verifications of these programs ...
Tesis Doctoral
Complejidad y universalidad en modelos de computación celular
(2003)
"La Computación Celular es una disciplina que se enmarca dentro del campo de investigación conocido como Computación Natural. Tiene como objetivo fundamental el desarrollo de modelos de computación inspirados en los procesos ...
Artículo
Efficient simulation of tissue-like P systems by transition cell-like P systems
(Springer, 2009)
In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create ...
Capítulo de Libro
The P Versus NP Problem Through Cellular Computing with Membranes
(Springer, 2004)
We study the P versus NP problem through membrane systems. Language accepting P systems are introduced as a framework allowing us to obtain a characterization of the P = NP relation by the polynomial time unsolvability ...
Capítulo de Libro
Generation of Diophantine Sets by Computing P Systems with External Output
(Springer, 2002)
In this paper a variant of P systems with external output designed to compute functions on natural numbers is presented. These P systems are stable under composition and iteration of functions. We prove that every ...
Artículo
Computational Efficiency of Cellular Division in Tissue-like Membrane Systems
(Romanian Academy, 2008)
Tissue-like P systems with cell division are computing models in the framework of membrane computing. They are inspired by the intercellular communication and neuronal synaptics, their structures being formalized ...