Bounding the Indegree of Spiking Neural P Systems
We continue the search of normal forms for spiking neural P systems, and we prove that the indegree of such systems (the maximal number of incoming synapses of neurons) can be bounded by 2 without losing the computational completeness.
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2006 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/53612 |
| Acceso en línea: | http://hdl.handle.net/11441/53612 |
| Access Level: | acceso abierto |
| Palabra clave: | spiking neuron spike train Membrane computing synapses indegree of graph recursively enumerable |
| Sumario: | We continue the search of normal forms for spiking neural P systems, and we prove that the indegree of such systems (the maximal number of incoming synapses of neurons) can be bounded by 2 without losing the computational completeness. |
|---|