• Icon

      Input-Driven Tissue P Automata  [Ponencia]

      Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu; Oswald, Marion; Verlan, Sergey (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      We introduce several variants of input-driven tissue P automata where the rules to be applied only depend on the input symbol. Both strings and multisets are considered as input objects; the strings are either read from ...
    • Icon

      Spiking Neural P Systems with Addition/Subtraction Computing on Synapses  [Ponencia]

      Jiang, Yun; Chen, Zhiqiang (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      Spiking neural P systems (SN P systems, for short) are a class of distributed and parallel computing models inspired from biological spiking neurons. In this paper, we introduce a variant called SN P systems with ...
    • Icon

      One-Membrane P Systems with Activation and Blocking of Rules  [Ponencia]

      Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      We introduce new possibilities to control the application of rules based on the preceding applications, which can be de ned in a general way for (hierarchical) P systems and the main known derivation modes. Computational ...
    • Icon

      Testing Identifiable Kernel P Systems Using an X-machine Approach  [Ponencia]

      Gheorghe, Marian; Ipate, Florentin; Lefticaru, Raluca; Turlea, Ana (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      This paper presents a testing approach for kernel P systems (kP systems), based on the X-machine testing framework and the concept of cover automaton. The testing methodology ensures that the implementation conforms the ...
    • Icon

      P Colony Automata with LL(k)-like Conditions  [Ponencia]

      Csuhaj Varjú, Erzsébet; Kántor, Kristóf; Vaszil, György (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages characterized by (generalized) P colony automata. We de ne a class of P colony automata satisfying a property ...
    • Icon

      Characterizing PSPACE with Shallow Non-Confluent P Systems  [Ponencia]

      Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      In P systems with active membranes, the question of understanding the power of non-confluence within a polynomial time bound is still an open problem. It is known that, for shallow P systems, that is, with only one level ...
    • Icon

      Introducing the Concept of Activation and Blocking of Rules in the General Framework for Regulated Rewriting in Sequential Grammars  [Ponencia]

      Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      We introduce new possibilities to control the application of rules based on the preceding application of rules which can be de ned for a general model of sequential grammars and we show some similarities to other control ...
    • Icon

      A Note on a New Class of APCol Systems  [Ponencia]

      Ciencialová, Lucie; Csuhaj Varjú, Erzsébet; Vaszil, György (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      We introduce a new acceptance mode for APCol systems (Automaton-like P colonies), variants of P colonies where the environment of the agents is given by a string and during functioning the agents change their own states ...
    • Icon

      Narrowing Frontiers of Efficiency with Evolutional Communication Rules and Cell Separation  [Ponencia]

      Orellana Martín, David; Valencia Cabrera, Luis; Song, Bosheng; Pan, Linqiang; Pérez Jiménez, Mario de Jesús (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      In the framework of Membrane Computing, several efficient solutions to computationally hard problems have been given. To find new borderlines between families of P systems that can solve them and the ones that cannot is ...
    • Icon

      Limits on P Systems with Proteins and Without Division  [Ponencia]

      Orellana Martín, David; Valencia Cabrera, Luis; Riscos Núñez, Agustín; Pérez Jiménez, Mario de Jesús (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      In the field of Membrane Computing, computational complexity theory has been widely studied trying to nd frontiers of efficiency by means of syntactic or semantical ingredients. The objective of this is to nd two kinds ...