Formal languages
Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Small universal register machines
Theoretical Computer Science - Special issue on universal machines and computations
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Pulsed neural networks
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Computation: finite and infinite machines
Computation: finite and infinite machines
Fundamenta Informaticae
Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
Natural Computing: an international journal
On the power of elementary features in spiking neural P systems
Natural Computing: an international journal
Bibliography of spiking neural P systems
Natural Computing: an international journal
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
Fundamenta Informaticae
How Redundant Is Your Universal Computation Device?
Membrane Computing
Solving numerical NP-complete problems with spiking neural P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Asynchronous spiking neural P systems: decidability and undecidability
DNA13'07 Proceedings of the 13th international conference on DNA computing
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
Fundamenta Informaticae
Hi-index | 0.00 |
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.