Opened Access On spiking neural P systems

Show item statistics
Export to
Author: Ibarra, Óscar H.
Pérez Jiménez, Mario de Jesús
Yokomori, Takashi
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2010
Published in: Natural computing, 9 (2), 475-491.
Document type: Article
Abstract: 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.
Cite: Ibarra, Ó.H., Pérez Jiménez, M.d.J. y Yokomori, T. (2010). On spiking neural P systems. Natural computing, 9 (2), 475-491.
Size: 602.6Kb
Format: PDF


DOI: 10.1007/s11047-009-9159-3

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)