Some Applications of Spiking Neural P Systems

In this paper we investigate some applications of spiking neural P systems regarding their capability to solve some classical computer science problems. In this respect versatility of such systems is studied to simulate a well known parallel computational model, namely the Boolean circuits. In addition, another notorious application -- sorting -- is considered within this framework

Computing by Folding

The present paper introduces a new computing paradigm based on the idea of string folding. Comparisons between the computational power of the proposed model with the classical families of languages from the Chomsky hierarchy are studied. Some preliminary results are reported and some conjectures are discussed. In this respect, the proposed model is promising not only because of the expected theoretical results, but also because of the possible indirect applications in various fields (as for instance, mathematical linguistics, DNA computing, computing using light, and so on)

Membrane Systems with Marked Membranes

AbstractMembrane computing is a biologically inspired computational paradigm. Motivated by brane calculi we investigate membrane systems which differ from conventional membrane systems by the following features: (1) biomolecules (proteins) can move through the regions of the systems, and can attach onto (and de-attach from) membranes, and (2) membranes can evolve depending on the attached molecules. The evolution of membranes is performed by using rules that are motivated by the operation of pinocytosis (the pino rule) and the operation of cellular dripping (the drip rule) that take place in living cells. We show that such membrane systems are computationally universal. We also show that if only the second feature is used then one can generate at least the family of Parikh images of the languages generated by programmed grammars without appearance checking (which contains non-semilinear sets of vectors). If, moreover, the use of pino/drip rules is non-cooperative (i.e., not dependent on the proteins attached to membranes), then one generates a family of sets of vectors that is strictly included in the family of semilinear sets of vectors. We also consider a number of decision problems concerning reachability of configurations and boundness

Multiset random context grammars, checkers, and transducers

We introduce a general model of random context multiset grammars as well as the concept of multiset random context checkers and transducers. Our main results show how recursively enumerable sets of finite multisets can be generated using these models of computing; corresponding results for antiport P systems are established, too