Asynchronous spiking neural P system with promoters

Abstract

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. © Springer-Verlag Berlin Heidelberg 2007.