Artículo
Handling Languages with Spiking Neural P Systems with Extended Rules
Autor/es | Cheng, Haiming
Ishdorj, Tseren-Onolt 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 | 2021-07-14 |
Publicado en |
|
Resumen | We consider spiking neural P systems with spiking rules allowed
to introduce zero, one, or more spikes at the same time. A tool-kit for computing
(some) operations with languages generated by such systems is provided. ... We consider spiking neural P systems with spiking rules allowed to introduce zero, one, or more spikes at the same time. A tool-kit for computing (some) operations with languages generated by such systems is provided. Com- puting the union of languages is easy. However, computing the concatenation or the intersection with a regular language is not so easy. A way to compute weak encoding is also provided. The main results of the computing power of the obtained systems are then presented, when considering them as number generating and as language generating devices. In particular, we find direct characterizations of finite and recursively enumerable languages (without using any squeezing mechanism, as it was necessary in the case of restricted rules). |
Agencias financiadoras | National Natural Science Foundation of China Ministerio de Educación y Ciencia (MEC). España |
Identificador del proyecto | No. 60573013
No 60421001 TIN2005-09345-C04-01 |
Cita | Cheng, H., Ishdorj, T., Paun, G. y Pérez Jiménez, M.d.J. (2006). Handling Languages with Spiking Neural P Systems with Extended Rules. Romanian Journal of Information Science and Technology (ROMJIST), 9 (3), 151-162. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Handling languages with spiking ... | 775.6Kb | [PDF] | Ver/ | |