Chinese Journal of Computers   Full Text
Title	Binary String Languages Generated by Spiking Neural P Systems with Exhaustive Use of Rules
Authors	.JIANG Yun SHI Xiao-Long ZHANG Zheng
Address	(Key Laboratory of Image Processing and Intelligent Control, Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074)
Year	2009
Issue	No.12(2355—2361)
Abstract &   Background	Abstract Spiking neural P systems are a new computing model inspired from the biological phenomena that the neurons cooperate to deal with spikes by axon in the brain. Here the authors consider computing devices of spiking neural P systems with exhaustive use of rules as string language generators, where the digit 1 is associated with a step when one or more spikes exit the output neuron, while the digit 0 is associated with a step when no spike is emitted by the output neuron, and the binary strings associated with halting computation constitutes resulting spike trains. In the case of binary strings generated by spiking neural P systems with exhaustive use of rules, it is found that characterization of finite and recursively enumerable languages. Keywords membrane computing; spiking neural P systems; exhaustive use of rules; binary string Background Following the pattern of learning ideas from biology, well-known areas of genetic algorithms and neural networks emerged in computer science, and formed the emerging area of natural computing, which is concerned with computing that is going on in nature or is inspired from nature. Membrane computing is a branch of natural computing initiated by Paun Gh.in 1998, which abstracts computing models from the structure and the functioning of living cells, as well as from the organization of cells in tissues or other higher order structures. This area developed quickly, several class of computing models were defined, and a series of applications were reported in recent years, in biology/medicine, linguistics, computer graphics, economics, approximate optimization, cryptography, etc. Recently, a new class of membrane systems, spiking neural P systems (SN P systems, for short), are introduced, with motivations related to the way neurons communicate by means of spikes. Since the SN P systems have been initiated, a lot of researchers dedicate themselves to this domain, and in less than three years there are more than 50 papers published on this topic. In this paper, SN P systems with exhaustive use of rules are considered as string language generators, and characterization of finite and recursively enumerable languages are found in binary strings generated by this kind of SN P systems. Furthermore, a number of potential research directions on SN P systems with exhaustive use of rules are also pointed out. In the past years, this research group has paid a lot of attentions on the area of membrane computing, especially, on SN P systems. It has solved plenty of problems on this topic and also has proposed many ideas. Up to now, the group has obtained 7 projects on the area of membrane computing from Natural Science Foundation of China and other foundations and has published more than 20 papers. The project was supported by the National Natural Science Foundation of China under grant Nos.60703047,60674106,30870826, and 30570431, and the Opening Foundation of Key Laboratory of Education Ministry for Image Processing and Intelligent Control under grant No.200703.