Spiking neural P systems with extended rules: universality and languages

  • Authors:

  • Haiming Chen;Mihai Ionescu;Tseren-Onolt Ishdorj;Andrei Păun;Gheorghe Păun;Mario J. Pérez-Jiménez

  • Affiliations:

  • Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing, China 100080;Universitat Rovira i Virgili, Tarragona, Spain 43005;Department of Computer Science and AI, University of Sevilla, Sevilla, Spain 41012 and Computational Biomodelling Laboratory, TUCS, Abo Akademi University, Turku, Finland 20520;Department of Computer Science, Louisiana Tech University, Ruston, USA 71272 and Faculdad de Informatíca, Universidad Politécnica de Madrid - UPM, Madrid, Spain 28660;Department of Computer Science and AI, University of Sevilla, Sevilla, Spain 41012 and Institute of Mathematics of the Romanian Academy, Bucharest, Romania 014700;Department of Computer Science and AI, University of Sevilla, Sevilla, Spain 41012

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous results from these areas are briefly recalled. Then, the computing power of the obtained systems is investigated, when considering them as number generating and as language generating devices. In the first case, a simpler proof of universality is obtained, while in the latter case we find characterizations of finite and recursively enumerable languages (without using any squeezing mechanism, as it was necessary in the case of standard rules). The relationships with regular languages are also investigated.