@article {,
	title = {Computing with spiking neural P systems: Traces and small universal systems},
	journal = {Lecture Notes in Computer Science},
	volume = {4287},
	year = {2006},
	pages = {1-16},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Recently, the idea of spiking neurons and thus of computing by spiking was incorporated into membrane computing, and so-called spiking neural P systems (abbreviated SN P systems) were introduced. Very shortly, in these systems neurons linked by synapses communicate by exchanging identical signals (spikes), with the information encoded in the distance between consecutive spikes. Several ways of using such devices for computing were considered in a series of papers, with universality results obtained in the case of computing numbers, both in the generating and the accepting mode; generating, accepting, or processing strings or infinite sequences was also proved to be of interest. 
In the present paper, after a short survey of central notions and results related to spiking neural P systems (including the case when SN P systems are used as string generators), we contribute to this area with two (types of) results: (i) we produce small universal spiking neural P systems (84 neurons are sufficient in the basic definition, but this number is decreased to 49 neurons if a slight generalization of spiking rules is adopted), and (ii) we investigate the possibility of generating a language by following the trace of a designated spike in its way through the neurons. 
},
	isbn = {978-3-540-49024-1},
	issn = {0302-9743},
	doi = {10.1007/11925903_1},
	url = {http://www.springerlink.com/content/b468k3xr45741t57/},
	author = {Mihai Ionescu and Andrei Paun and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez}
}
