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 QIDQ2139052
Hong Peng, Qian Yang, Jun Wang, Nan Zhou, Xiao-Hui Luo
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
membrane computingcomputational completenessstring languagespiking neural P systems with inhibitory rules
Related Items (2)
Variants of spiking neural P systems and their operational semantics in Haskell ⋮ Nonlinear neural-like P model for time series classification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spiking neural P systems with neuron division and budding
- On languages generated by spiking neural P systems with weights
- Spiking neural P systems with extended rules: universality and languages
- Computing along the axon
- 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
- Uniform solutions to SAT and 3-SAT by spiking neural P systems with pre-computed resources
- Computing with membranes
- Dendrite P systems
- On string languages generated by sequential spiking neural P systems based on the number of spikes
- Spiking neural P systems with multiple channels
- Computational power of dynamic threshold neural P systems for generating string languages
- 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
- Spiking Neural P Systems with Astrocytes
This page was built for publication: Computational completeness of spiking neural P systems with inhibitory rules for generating string languages
