BWMC2006. Brainstorming Week On Membrane Computing (4th. 2006. Sevilla)

URI permanente para esta colecciónhttps://hdl.handle.net/11441/34355

Examinar

Examinando BWMC2006. Brainstorming Week On Membrane Computing (4th. 2006. Sevilla) por Autor "Chen, Haiming"

Seleccione resultados tecleando las primeras letras
Mostrando 1 - 5 de 5
  • Miniatura
    Acceso AbiertoPonencia
    Computing Along the Axon
    (Fénix Editora, 2006) Chen, Haiming; Ishdorj, Tseren-Onolt; Paun, Gheorghe; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
    We consider a special form of spiking neural P systems, called axon P sys- tems, corresponding to the activity of Ranvier nodes of neuron axon, and we briefly investigate the language generative power of these devices
  • Miniatura
    Acceso AbiertoPonencia
    On String Languages Generated by Spiking Neural P Systems
    (Fénix Editora, 2006) Chen, Haiming; Freund, Rudolf; Ionescu, Mihai; Paun, Gheorghe; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Educación y Ciencia (MEC). España; Universidad de Sevilla. TIC193: Computación Natural
    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.
  • Miniatura
    Acceso AbiertoPonencia
    On the Efficiency of Spiking Neural P Systems
    (2006) Chen, Haiming; Ionescu, Mihai; Ishdorj, Tseren-Onolt; Universidad de Sevilla. TIC193: Computación Natural
    Spiking neural P systems were recently introduced in and proved to be Turing complete as number computing devices. In this paper we show that these systems are also computationally efficient. Specifically, we present a variant of spiking neural P systems which have, in their initial configuration, an arbitrarily large number of inactive neurons which can be activated (in an exponential number) in polynomial time. Using this model of P systems we can deterministically solve the satisfiability problem (SAT) in constant time.
  • Miniatura
    Acceso AbiertoPonencia
    On Trace Languages Generated by Spiking Neural P Systems
    (Fénix Editora, 2006) Chen, Haiming; Ionescu, Mihai; Paun, Andrei; Paun, Gheorghe; Popa, Bianca; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
    We extend to spiking neural P systems a notion investigated in the “stan- dard” membrane systems: the language of the traces of a distinguished object. In our case, we distinguish a spike by “marking” it and we follow its path through the neurons of the system, thus obtaining a language. Several examples are discussed and some preliminary results about this way of associating a language with a spiking neural P system are given, together with a series of topics for further research. For instance, we show that each regular language is the morphic image of a trace language intersected with a very particular regular language, while each recursively enumerable language over the one-letter alphabet is the projection of a trace language.
  • Miniatura
    Acceso AbiertoPonencia
    Spiking Neural P Systems with Extended Rules
    (Fénix Editora, 2006) Chen, Haiming; Ishdorj, Tseren-Onolt; Paun, Gheorghe; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Educación y Ciencia (MEC). España; Universidad de Sevilla. TIC193: Computación Natural
    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.