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

Spiking neural P systems with extended rules: universality and languages

Opened Access Spiking neural P systems with extended rules: universality and languages

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: Chen, Haiming
Ionescu, Mihai
Ishdorj, Tseren-Onolt
Paun, Andrei
Paun, Gheorghe
Pérez Jiménez, Mario de Jesús
Departamento: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Fecha: 2008
Publicado en: Natural Computing, 7 (2), 147-166.
Tipo de documento: Artículo
Resumen: 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.
Cita: Chen, H., Ionescu, M., Ishdorj, T., Paun, A., Paun, G. y Pérez Jiménez, M.d.J. (2008). Spiking neural P systems with extended rules: universality and languages. Natural Computing, 7 (2), 147-166.
Tamaño: 1.029Mb
Formato: PDF

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

DOI: 10.1007/s11047-006-9024-6

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones