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 "Freund, Rudolf"

Seleccione resultados tecleando las primeras letras
Mostrando 1 - 5 de 5
  • Miniatura
    Acceso AbiertoPonencia
    Multiset Random Context Grammars, Checkers, and Transducers
    (Fénix Editora, 2006) Cavaliere, Matteo; Freund, Rudolf; Oswald, Marion; Sburlan, Dragos
    We introduce a general model of random context multiset grammars as well as the concept of multiset random context checkers and transducers. Our main results show how recursively enumerable sets of finite multisets can be generated using these models of computing; corresponding results for antiport P systems are established, too.
  • 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
    Particular Results for Variants of P Systems with One Catalyst in One Membrane
    (Fénix Editora, 2006) Freund, Rudolf
    Purely catalytic P systems can generate all recursively enumerable sets of natural numbers with only three catalysts in one membrane, whereas we know that one catalyst in one membrane is not enough. On the other hand, P systems also allowing (non-catalytic) non-cooperative evolution rules with only two catalysts in one membrane are already computationally complete, too. We here investigate special variants of P systems with only one catalyst in one membrane that are not computationally complete, i.e., variants of P systems with only one catalyst in one membrane that cannot generate all recursively enumerable sets of natural numbers.
  • Miniatura
    Acceso AbiertoPonencia
    Small Universal Antiport P Systems and Universal Multiset Grammars
    (Fénix Editora, 2006) Freund, Rudolf; Oswald, Marion
    Based on the construction of a universal register machine we construct a universal antiport P system working with 31 rules in the maximally parallel mode in one membrane, and a universal antiport P system with forbidden context working with 16 rules in the sequential derivation mode in one membrane for computing any partial recursive function on the set of natural numbers. For accepting/generating any arbitrary recursively enumerable set of natural numbers we need 31/33 and 16/18 rules, respectively. As a consequence of the result for antiport P systems with forbidden context we immediately infer similar results for forbidden random context multiset grammars with arbitrary rules.
  • Miniatura
    Acceso AbiertoPonencia
    Two Universality Results for (Mem)Brane Systems
    (Fénix Editora, 2006) Besozzi, Daniela; Busi, Nadia; Franco, Giuditta; Freund, Rudolf; Paun, Gheorghe; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193: Computación Natural
    We prove that P systems with mate and drip operations and using at most five membranes during any step of a computation are universal. This improves a recent similar result from, where eleven membranes are used. The proof of this result has the "drawback" that the output of a computation is obtained on an inner membrane of the system. A universality proof is then given for the case when the result of a computation is found on the skin membrane (on its external side, hence "visible" from the environment), but in this case we use one more membrane, as well as another basic brane operation exo; moreover, the operations are now of the projective type, as introduced in.