@article {648,
title = {Spiking Neural P Systems: An improved normal form},
journal = {Theoretical Computer Science},
volume = {411},
year = {2010},
month = {02/2010},
pages = {906-918},
publisher = {Elsevier},
address = {Amsterdam (The Netherlands)},
abstract = {Spiking neural P systems (in short, SN P systems) are computing devices based on the way the neurons communicate through electrical impulses (spikes). These systems involve various ingredients; among them, we mention forgetting rules and the delay in firing rules. However, it is known that the universality can be obtained without using these two features. In this paper we improve this result in two respects: (i) each neuron contains at most two rules (which is optimal for systems used in the generative mode), and (ii) the rules in the neurons using two rules have the same regular expression which controls their firing. This result answers a problem left open in the literature, and, in this context, an incompleteness in some previous proofs related to the elimination of forgetting rules is removed. Moreover, this result shows a somewhat surprising uniformity of the neurons in the SN P systems able to simulate Turing machines, which is both of a theoretical interest and it seems to correspond to a biological reality. When a bound is imposed on the number of spikes present in a neuron at any step of a computation (such SN P systems are called finite), two surprising results are obtained. First, a characterization of finite sets of numbers is obtained in the generative case (this contrasts the case of other classes of SN P systems, where characterizations of semilinear sets of numbers are obtained for finite SN P systems). Second, the accepting case is strictly more powerful than the generative one: all finite sets and also certain arithmetical progressions can be accepted. A precise characterization of the power of accepting finite SN P systems without forgetting rules and delay remains to be found.},
keywords = {Membrane computing; Spiking neural P system; Turing computability; Semilinear set},
issn = {0304-3975},
doi = {doi:10.1016/j.tcs.2009.11.010 },
url = {http://www.pubzone.org/dblp/journals/tcs/PanP10},
author = {Linqiang Pan and Gheorghe Paun}
}