On spiking neural P systems

Authors:
Oscar H. Ibarra;Mario J. Pérez-Jiménez;Takashi Yokomori
Affiliations:
Department of Computer Science, University of California, Santa Barbara, USA 93106;Department of Computer Science and AI, University of Seville, Sevilla, Spain;Department of Mathematics, Faculty of Education and Integrated Arts and Sciences, Waseda University, Tokyo, Japan 169-8050
Venue:
Natural Computing: an international journal
Year:
2010

Citing 10
Cited 0

Systolic Trellis automata: stability, decidability and complexity

Information and Control
Spiking Neuron Models: An Introduction

Spiking Neuron Models: An Introduction
Spiking Neural P Systems

Fundamenta Informaticae
Normal forms for spiking neural P systems

Theoretical Computer Science
Computability limits in membrane computing

Computability limits in membrane computing
Spiking neural P systems with extended rules: universality and languages

Natural Computing: an international journal
Asynchronous spiking neural P systems: decidability and undecidability

DNA13'07 Proceedings of the 13th international conference on DNA computing
Characterizations of some restricted spiking neural p systems

WMC'06 Proceedings of the 7th international conference on Membrane Computing
On spiking neural p systems and partially blind counter machines

UC'06 Proceedings of the 5th international conference on Unconventional Computation
Spiking neural p systems: some characterizations

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

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.