On the power of families of recognizer spiking neural P systems
From MaRDI portal
Publication:3076599
Recommendations
Cites work
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- scientific article; zbMATH DE number 1314295 (Why is no real title available?)
- A new algorithm for regularizing one-letter context-free grammars.
- A universal interconnection pattern for parallel computers
- Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
- Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
- Relations Among Complexity Measures
- Simulation of Parallel Random Access Machines by Circuits
- Uniform solutions to SAT and subset sum by spiking neural P systems
Cited in
(2)
This page was built for publication: On the power of families of recognizer spiking neural P systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076599)