Home > Papers

 
 
On String Languages Generated by Spiking Neural P Systems with Exhaustive Use of Rules
Zhang Xingyi,Zeng Xiangxiang,Pan Linqiang * #
Department of Control Science and Engineering, Huazhong University of Science and Technology
*Correspondence author
#Submitted by
Subject:
Funding: 教育部博士点基金,国家自然科学基金,国家自然科学基金,国家自然科学基金,国家自然科学基金（No.20060487014,60373089,60674106,30570431,60533010）
Opened online: 2 April 2008
Accepted by: none
Citation: Zhang Xingyi,Zeng Xiangxiang,Pan Linqiang.On String Languages Generated by Spiking Neural P Systems with Exhaustive Use of Rules[OL]. [ 2 April 2008] http://en.paper.edu.cn/en_releasepaper/content/20057
 
 
We continue the study of spiking neural P systems with exhaustive use of rules by considering these computing devices as language generators, where a step is associated with a symbol according to the number of spikes emitted by the output neuron and the sequence of these symbols associated with a halting computation of a given system constitutes a string. About string languages generated by spiking neural P systems with exhaustive use of rules, two cases are considered, one is interpreting a step as a new symbol when no spike is emitted, the other is interpreting it as the empty string. In all these cases, it is proved that finite and recursively enumerable languages are characterized by spiking neural P systems in exhaustive mode. Moreover, the relationships with regular languages are also investigated.
Keywords:Membrane computing; Register machine; SN P systems
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 333
Bookmarked 0
Recommend 5
Comments Array
Submit your papers