|Title||On string languages generated by Spiking Neural P systems|
|Publication Type||Journal Papers|
|Year of Publication||2007|
|Authors||Chen, H., Freund R., Ionescu M., Paun G., & Pérez-Jiménez M. J.|
|Journal Title||Fundamenta Informaticae|
|Place Published||Amsterdam, Holanda|
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.
|Keywords||chomsky hierarchy, Membrane computing, spiking neural P systems|