Computational completeness of spiking neural P systems with inhibitory rules for generating string languages
From MaRDI portal
Publication:2139052
DOI10.1016/J.TCS.2022.02.025OpenAlexW4213429406MaRDI QIDQ2139052FDOQ2139052
Hong Peng, Xiao-Hui Luo, Qian Yang, Jun Wang, Nan Zhou
Publication date: 17 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.025
computational completenessmembrane computingstring languagespiking neural P systems with inhibitory rules
Cites Work
- Computing with membranes
- Title not available (Why is that?)
- Spiking neural P systems with rules on synapses
- Fuzzy reasoning spiking neural P system for fault diagnosis
- Uniform solutions to SAT and subset sum by spiking neural P systems
- Title not available (Why is that?)
- Spiking neural P systems with neuron division and budding
- On languages generated by spiking neural P systems with weights
- Spiking neural P systems
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
- Spiking neural P systems with extended rules: universality and languages
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- On languages generated by asynchronous spiking neural P systems
- On string languages generated by spiking neural P systems with exhaustive use of rules
- Computational power of dynamic threshold neural P systems for generating string languages
- Spiking neural P systems with astrocytes
- Computing along the axon
- On string languages generated by sequential spiking neural P systems based on the number of spikes
- Dendrite P systems
- Spiking neural P systems with multiple channels
Cited In (4)
This page was built for publication: Computational completeness of spiking neural P systems with inhibitory rules for generating string languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139052)
