Opened Access On spiking neural P systems

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Ibarra, Óscar H.
Pérez Jiménez, Mario de Jesús
Yokomori, Takashi
Departamento: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Fecha: 2010
Publicado en: Natural computing, 9 (2), 475-491.
Tipo de documento: Artículo
Resumen: This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an SN P system is presented. The analysis of the diagram cycles codifies invariants formulae which enable us to establish the soundness and completeness of the system with respect to the problem it tries to resolve. We also study the universality of asynchronous and sequential SN P systems and the capability these models have to generate certain classes of languages. Further, by making a slight modification to the standard SN P systems, we introduce a new variant of SN P systems with a special I/O mode, called SN P modules, and study their computing power. It is demonstrated that, as string language acceptors and transducers, SN P modules can simulate several types of computing devices such as finite automata, a-finite transducers, and systolic trellis automata.
Cita: Ibarra, Ó.H., Pérez Jiménez, M.d.J. y Yokomori, T. (2010). On spiking neural P systems. Natural computing, 9 (2), 475-491.
Tamaño: 602.6Kb
Formato: PDF

URI: https://hdl.handle.net/11441/69540

DOI: 10.1007/s11047-009-9159-3

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones