%0 Generic %D 2007 %T On string languages generated by Spiking Neural P systems %A Haiming Chen %A Rudolf Freund %A Mihai Ionescu %A Gheorghe Paun %A Mario J. Pérez-Jiménez %C Warsaw, Poland %I IOS Press %K chomsky hierarchy %K Membrane computing %K spiking neural P systems %N 1-4 %P 141-162 %U http://portal.acm.org/citation.cfm?id=1232299.1232308&coll=&dl=acm&CFID=15151515&CFTOKEN=6184618 %V 75 %X 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.