We continue the study of spiking neural P systems by considering these computing devices as binary string generators: the set of spike trains of halting computations of a given system constitutes the language generated by that system. Although the "direct" generative capacity of spiking neural P systems is rather restricted (some very simple languages cannot be generated in this framework), regular languages are inverse-morphic images of languages of finite spiking neural P systems, and recursively enumerable languages are projections of inverse-morphic images of languages generated by spiking neural P systems.
Chen Haiming,Freund Rudolf,Ionescu Mihai,et al. on string languages generated by spiking neural p systems[J]. Fundamenta Informaticae,2007-01-01,75(1-4):141-162.
