Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application
From MaRDI portal
Publication:5217119
DOI10.1142/S0129054120400080zbMath1430.68113OpenAlexW3003612960MaRDI QIDQ5217119
Florin-Daniel Bîlbîe, Andrei Păun
Publication date: 21 February 2020
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054120400080
Related Items (3)
Asynchronous spiking neural P systems with local synchronization of rules ⋮ Small SNQ P systems with multiple types of spikes ⋮ Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding whether a regular language is generated by a splicing system
- On the computational complexity of spiking neural P systems
- Accepting networks of splicing processors: complexity results
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Small universal register machines
- Networks of picture processors as problem solvers
- Membrane computing. An introduction.
- Sequential SNP systems based on min/max spike number
- Networks of splicing processors with evaluation sets as optimization problems solvers
- All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
- FILTER POSITION IN NETWORKS OF SUBSTITUTION PROCESSORS DOES NOT MATTER
- Accepting Networks of Non-inserting Evolutionary Processors
- Spiking Neuron Models
- Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application
- SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS
This page was built for publication: Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application
