Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Small deterministic 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
The Quest for Small Universal Cellular Automata
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Computation: finite and infinite machines
Computation: finite and infinite machines
On string languages generated by spiking neural P systems with exhaustive use of rules
Natural Computing: an international journal
Smaller Universal Spiking Neural P Systems
Fundamenta Informaticae
Asynchronous spiking neural P systems
Theoretical Computer Science
Uniform solutions to SAT and Subset Sum by spiking neural P systems
Natural Computing: an international journal
Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
Theoretical Computer Science
A note on small universal spiking neural p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Sequentiality induced by spike number in SNP systems: small universal machines
CMC'11 Proceedings of the 12th international conference on Membrane Computing
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Fundamenta Informaticae
Asynchronous spiking neural P systems with local synchronization
Information Sciences: an International Journal
Hi-index | 5.23 |
Spiking neural P systems (SN P systems, for short) are a class of membrane systems inspired from the way the neurons process information and communicate by means of spikes. In this paper, we introduce and investigate a new class of SN P systems, with spiking rules placed on synapses. The computational completeness is first proved, then two small universal SN P systems with rules on synapses for computing functions are constructed. Specifically, when using standard spiking rules, we obtain a universal system with 39 neurons, while when using extended spiking rules on synapses, a universal SN P system with 30 neurons is constructed.