Buscar
Mostrando ítems 21-30 de 74
Artículo
On the efficiency of cell-like and tissue-like recognizing membrane systems
(Wiley, 2009)
Cell-like recognizing membrane systems are computational devices in the framework of membrane computing inspired from the structure of living cells, where biological membranes are arranged hierarchically. In this paper ...
Artículo
Cellular modelling using P systems and process algebra.
(Taylor and Francis Online, 2007)
In this paper various molecular chemical interactions are modelled under different computational paradigms. P systems and -calculus are used to describe intra-cellular reactions like protein-protein interactions and ...
Artículo
Complexity aspects of polarizationless membrane systems
(Springer, 2009)
We investigate polarizationless P systems with active membranes working in maximally parallel manner, which do not make use of evolution or communication rules, in order to find which features are sufficient to efficiently ...
Artículo
P–Lingua 2.0: A software framework for cell–like P systems
(Agora University of Oradea, Romania, 2009)
P-Lingua is a programming language for membrane computing. It was first presented in Edinburgh, during the Ninth Workshop on Membrane Computing (WMC9). In this paper, the models, simulators and formats included in P-Lingua ...
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
Formal proofs about rewriting using ACL2
(Springer, 2002)
We present an application of the ACL2 theorem prover to reason about rewrite systems theory. We describe the formalization and representation aspects of our work using the firstorder, quantifier-free logic of ACL2 and ...
Artículo
Verifying a P system generating squares
(Romanian Academy, Section for Information Science and Technology, 2002)
In [1], an example of a P system generating exactly all the squares of natural numbers greater than 1 is given. Nevertheless, only an informal reasoning of this result is presented. In this paper we study a similar P ...
Artículo
Modelos de computación celular con membranas
(SEMA, 2004)
Artículo
A linear-time tissue P system based solution for the 3-coloring problem
(Elsevier, 2007)
In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NPcomplete problems in polynomial time can be found (obviously, trading space for time). Recently, different new ...
Artículo
Maude: specification and programming in rewriting logic
(Elsevier, 2002)
Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational ...