Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Spiking Neuron Models: An Introduction
Spiking Neuron Models: An Introduction
Computation: finite and infinite machines
Computation: finite and infinite machines
Fundamenta Informaticae
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Spiking Neural P Systems. Power and Efficiency
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
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
On string languages generated by spiking neural P systems with exhaustive use of rules
Natural Computing: an international journal
Experiments on the reliability of stochastic spiking neural P systems
Natural Computing: an international journal
Characterizations of some classes of spiking neural P systems
Natural Computing: an international journal
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
Fundamenta Informaticae
Asynchronous spiking neural P systems
Theoretical Computer Science
On languages generated by asynchronous spiking neural P systems
Theoretical Computer Science
Sequential SNP systems based on min/max spike number
Theoretical Computer Science
Uniform solutions to SAT and Subset Sum by spiking neural P systems
Natural Computing: an international journal
Homogeneous Spiking Neural P Systems
Fundamenta Informaticae
Spiking neural P systems used as acceptors and transducers
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
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
Natural Computing: an international journal
Computationally complete spiking neural P systems without delay: two types of neurons are enough
CMC'10 Proceedings of the 11th international conference on Membrane computing
Selected topics in computational complexity of membrane systems
Computation, cooperation, and life
Computing k-block Morphisms by Spiking Neural P Systems
Fundamenta Informaticae
Limited Asynchronous Spiking Neural P Systems
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Homogeneous Spiking Neural P Systems
Fundamenta Informaticae
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
Fundamenta Informaticae
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Spiking neural p systems: some characterizations
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Universality of sequential spiking neural P systems based on minimum spike number
Theoretical Computer Science
Bridging Membrane and Reaction Systems --Further Results and Research Topics
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 5.23 |
The spiking neural P systems are a class of computing devices recently introduced as a bridge between spiking neural nets and membrane computing. In this paper we prove a series of normal forms for spiking neural P systems, concerning the regular expressions used in the firing rules, the delay between firing and spiking, the forgetting rules used, and the outdegree of the graph of synapses. In all cases, surprising simplifications are found, without losing the computational completeness - sometimes at the price of (slightly) increasing other parameters which describe the complexity of these systems.