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 "Busi, Nadia"

Seleccione resultados tecleando las primeras letras
Mostrando 1 - 3 de 3
  • Miniatura
    Acceso AbiertoPonencia
    A Case Study in (Mem)Brane Computation: Generating {n2 | n 1}
    (Fénix Editora, 2006) Busi, Nadia; Gutiérrez Naranjo, Miguel Ángel; 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
    The aim of this paper is to start an investigation and a comparison of the expressiveness of the two most relevant formalisms inspired by membranes interactions, namely, P systems and Brane Calculi. We compare the two formalisms w.r.t. their ability to act as language generators. In particular, we show different ways of generating the set L = {n2 | n 1} in P systems and in Brane Calculi.
  • Miniatura
    Acceso AbiertoPonencia
    Decidability of Divergence for Catalytic P Systems
    (Fénix Editora, 2006) Busi, Nadia
    P systems are a biologically inspired model introduced by Gheorghe P¸aun with the aim of representing the structure and the functioning of the cell. Since their introduction, several variants of P systems have been proposed and explored. We concentrate on the class of catalytic P systems without priorities associated to the rules. We show that the divergence problem (i.e., checking for the existence of an infinite computation) is decidable in such a class of P systems. As a corollary, we obtain an alternative proof of the nonuniversality of deterministic catalytic P systems, an open problem recently solved by Ibarra and Yen.
  • 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.