On spiking neural P systems

Oscar H. Ibarra, Mario J. Pérez-Jiménez, Takashi Yokomori

Research output: Contribution to journalReview article

5 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)475-491
Number of pages17
JournalNatural Computing
Volume9
Issue number2
DOIs
Publication statusPublished - 2010 Jun 1

Keywords

  • Asynchronous
  • Finite automaton
  • Finite state transducer
  • Formal verification
  • Sequential
  • Spiking neural P system
  • Systolic trellis automaton
  • Universality

ASJC Scopus subject areas

  • Computer Science Applications

Fingerprint Dive into the research topics of 'On spiking neural P systems'. Together they form a unique fingerprint.

  • Cite this