On String Languages Generated by Spiking Neural P Systems

Abstract

Summary. 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 computa-tions of a given system constitutes the language generated by that system. Although the work of spiking neural P systems is rather restricted (and this is illustrated by the fact that 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. 1