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 ...

Spiking neural P systems (SN P systems for short) is a developing field within the P systems world. Inspired by the neurophysiological structure of the brain, these systems have been subjected to many extensions in recent ...

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 ...

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 ...

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 ...

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 ...

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 ...

The usual way to find a solution for a NP complete problem with Membrane Computing techniques is by brute force algorithms where all the feasible solutions are generated and they are checked simultaneously by using massive ...

In this paper we present a tissue-like P systems model with cell division the environment has been replaced by an extra cell. In such model, we present a uniform family of recognizer P systems which solves the Subset Sum ...

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 ...