Search
Now showing items 1-10 of 58
Presentation

Characterizing Tractability by Tissue-Like P Systems
(Fénix Editora, 2009)
In the framework of cell–like membrane systems it is well known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP–complete problems. Nonetheless, it may be ...
Presentation

P Systems with Replicator Dynamics: A Proposal
(Fénix Editora, 2011)
This short note proposes some ideas for considering evolutionary game theory in the area of membrane computing
Presentation

Notes About Spiking Neural P Systems
(Fénix Editora, 2011)
Spiking neural P systems (SN P systems, for short) are much investigated in the last years in membrane computing, but still many open problems and research topics are open in this area. Here, we first recall two such ...
Presentation

Implementing Local Search with Membrane Computing
(Fénix Editora, 2011)
Local search is currently one of the most used methods for finding solution in real-life problems. In this paper we present an implementation of local search with Membrane Computing techniques applied to the N-queens ...
Presentation

Spiking Neural P Systems with Several Types of Spikes
(Fénix Editora, 2011)
With a motivation related to gene expression, where enzymes act in series, somewhat similar to the train spikes traveling along the axons of neurons, we consider an extension of spiking neural P systems, where several ...
Presentation

Spiking Neural dP Systems
(Fénix Editora, 2011)
We bring together two topics recently introduced in membrane computing, the much investigated spiking neural P systems (in short, SN P systems), inspired from the way the neurons communicate through spikes, and the dP ...
Presentation

Forward and Backward Chaining with P Systems
(Fénix Editora, 2011)
On the one hand, one of the concepts which lies at the basis of membrane computing is the multiset rewriting rule. On the other hand, the paradigm of rules is profusely used in computer science for representing and dealing ...
Presentation

Towards Bridging Two Cell-Inspired Models: P Systems and R Systems
(Fénix Editora, 2011)
We examine, from the point of view of membrane computing, the two basic assumptions of reaction systems, the "threshold" and "no permanence" ones. In certain circumstances (e.g., defining the successful computations by ...
Presentation

dP Automata versus Right-Linear Simple Matrix Grammars
(Fénix Editora, 2011)
We consider dP automata with the input string distributed in an arbitrary (hence not necessary balanced) way, and we investigate their language accepting power, both in the case when a bound there is on the number of ...
Presentation

On Communication Complexity in Evolution-Communication P Systems
(Fénix Editora, 2010)
Looking for a theory of communication complexity for P systems, we consider here so-called evolution-communication (EC for short) P systems, where objects evolve by multiset rewriting rules without target commands and ...