Asynchronous Spiking Neural P System with Promoters
A new class of parallel computing devices called asynchronous spiking neural P systems with promoters is introduced. Unlike the regular spiking neural P systems, they work without help of the universal clock but they include a set of promoters. The computing power of these systems is proved to be Turing complete when they are considered as number generators. When they are considred as language generators, it is proved that any regular language can be a coding morphic image of the generated language of an asynchronous spiking neural P system.
Molecular Computing Membrane Computing P System Parallel Computing Asynchronous P System Turing Complete
Zhimin Yuan Zhiguo Zhang
Department of Computer Science Sun Yatsen University Guangzhou City, 510275 China
国际会议
7th International Symposium,APPT 2007(第7届高级并行处理技术大会)
广州
英文
693-702
2007-11-22（万方平台首次上网日期，不代表论文的发表时间）