On String Languages Generated by Spiking Neural P Systems

  • Authors:

  • Haiming Chen;Rudolf Freund;Mihai Ionescu;Gheorghe Păun;Mario J. Pérez-Jiménez

  • Affiliations:

  • Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences, 100080 Beijing, China. E-mail: chm@ios.ac.cn;Faculty of Informatics, Technische Universität Wien, Favoritenstraße 9, A-1040 Wien, Austria. E-mail: rudi@emcc.at;Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain. E-mail: armandmihai.ionescu@urv.net;Inst. of Math. of the Romanian Academy PO Box 1-764, 014700 Bucharest, Romania and Department of Computer Science and AI, University of Sevilla, Avda Reina Mercedes s/n, 41012 Sevilla, Spain;Department of Computer Science and AI, University of Sevilla, Avda Reina Mercedes s/n, 41012 Sevilla, Spain. E-mails: marper@us.es, george.paun@imar.ro, gpaun@us.es

  • Venue:
  • Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.