On spiking neural P systems |
| |
Authors: | Oscar H Ibarra Mario J Pérez-Jiménez Takashi Yokomori |
| |
Affiliation: | (1) Department of Computer Science, University of California, Santa Barbara, CA 93106, USA;(2) Department of Computer Science and AI, University of Seville, Sevilla, Spain;(3) Department of Mathematics, Faculty of Education and Integrated Arts and Sciences, Waseda University, 1-6-1 Nishi-waseda, Shinjuku-ku, Tokyo 169-8050, Japan |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|