Ponencia
On String Languages Generated by Spiking Neural P Systems
Autor/es | Chen, Haiming
Freund, Rudolf Ionescu, Mihai 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 de publicación | 2006 |
Fecha de depósito | 2016-03-09 |
Publicado en |
|
ISBN/ISSN | 8461106814 |
Resumen | 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 ... 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 work of spiking neural P systems is rather restricted (and this is illustrated by the fact that 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. |
Agencias financiadoras | Ministerio de Educación y Ciencia (MEC). España |
Identificador del proyecto | TIN2005-09345-C04-01 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
stringsR.pdf | 232.0Kb | [PDF] | Ver/ | |