Spiking neural P systems with extended rules: universality and languages

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 o...

Full description

Saved in:
Bibliographic Details
Published in:Natural computing 2008-06, Vol.7 (2), p.147-166
Main Authors: Chen, Haiming, Ionescu, Mihai, Ishdorj, Tseren-Onolt, Păun, Andrei, Păun, Gheorghe, Pérez-Jiménez, Mario J.
Format: Article
Language:English
Subjects:
Artificial Intelligence
Complex Systems
Computer Science
Evolutionary Biology
Membranes
Neural networks
Processor Architectures
Studies
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1567-7818
1572-9796
DOI:10.1007/s11047-006-9024-6