Universality of SNQ P systems using one type of spikes and restrictive rule application
From MaRDI portal
Publication:5217119
Recommendations
- Small SNQ P systems with multiple types of spikes
- A look at the descriptional complexity of SNQ P systems
- On Some Classes of Sequential Spiking Neural P Systems
- Universality of spiking neural P systems with polarizations working in sequential mode induced by maximum spike number
- An improved universal spiking neural P system with generalized use of rules
Cites work
- scientific article; zbMATH DE number 1314295 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Accepting Networks of Non-inserting Evolutionary Processors
- Accepting networks of splicing processors: complexity results
- All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
- Deciding whether a regular language is generated by a splicing system
- Filter position in networks of substitution processors does not matter
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Membrane computing. An introduction.
- Networks of picture processors as problem solvers
- Networks of splicing processors with evaluation sets as optimization problems solvers
- On the computational complexity of spiking neural P systems
- SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS
- Sequential SNP systems based on min/max spike number
- Small universal register machines
- Spiking Neuron Models
- Spiking neural P systems
- Universality of SNQ P systems using one type of spikes and restrictive rule application
Cited in
(5)- Spiking neural P systems with mute rules
- Small SNQ P systems with multiple types of spikes
- Universality of SNQ P systems using one type of spikes and restrictive rule application
- Asynchronous spiking neural P systems with local synchronization of rules
- A look at the descriptional complexity of SNQ P systems
This page was built for publication: Universality of SNQ P systems using one type of spikes and restrictive rule application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217119)