Repositorio de producción científica de la Universidad de Sevilla

Spiking Neural P Systems with Extended Rules

 

Advanced Search
 
Opened Access Spiking Neural P Systems with Extended Rules
Cites
Show item statistics
Icon
Export to
Author: Chen, Haiming
Ishdorj, Tseren-Onolt
Paun, Gheorghe
Pérez Jiménez, Mario de Jesús
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2006
Published in: Proceedings of the Fourth Brainstorming Week on Membrane Computing, Vol.I, 241-265. Sevilla, E.T.S. de Ingeniería Informática, 30 de Enero-3 de Febrero, 2006
ISBN/ISSN: 8461106814
Document type: Presentation
Abstract: We consider spiking neural P systems with spiking rules allowed to introduce zero, one, or more spikes at the same time. 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 (universality is already known for the restricted rules), 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 restricted rules). The relationships with regular languages are also investigated. In the end of the paper, a tool-kit for computing (some) operations with languages is provided.
Size: 310.4Kb
Format: PDF

URI: http://hdl.handle.net/11441/38236

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)