On languages generated by spiking neural P systems with weights

Spiking neural P systems with weights (WSN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. It has been proved that WSN P systems can generate/recognize Turing computable set of numbers (i.e., they are Turing un...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences Vol. 278; pp. 423 - 433
Main Authors: Zeng, Xiangxiang, Xu, Lei, Liu, Xiangrong, Pan, Linqiang
Format: Journal Article
Language:English
Published: Elsevier Inc 10.09.2014
Subjects:
Membrane computing
Natural computing
Recursively enumerable language
Spiking neural P system
Turing universality
Membrane computing
Natural computing
Spiking neural P system
Turing universality
Recursively enumerable language
ISSN:0020-0255, 1872-6291
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Spiking neural P systems with weights (WSN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. It has been proved that WSN P systems can generate/recognize Turing computable set of numbers (i.e., they are Turing universal as number generators/recognizers). In this work, we investigate the language generation power of WSN P systems, where the set of spike trains of halting computations of a given WSN P system constitutes the language generated by that system. Several relationships of the families of languages generated by WSN P systems with the family of finite languages and the family of regular languages are obtained. The family of recursively enumerable languages is characterized by projections of inverse-morphic images of languages generated by WSN P systems.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2014.03.062