Now showing items 1-20 of 52

    • Icon

      A Formal Framework for P Systems with Dynamic Structure  [Presentation]

      Freund, Rudolf; Pérez Hurtado de Mendoza, Ignacio; Riscos Núñez, Agustín; Verlan, Sergey (Fénix Editora, 2012)
      This article introduces a formalism/framework able to describe different variants of P systems having a dynamic structure. This framework can be useful for the definition of new variants of P systems with dynamic structure, ...
    • Icon

      A formalization of membrane systems with dynamically evolving structures  [Article]

      Freund, Rudolf; Pérez Hurtado de Mendoza, Ignacio; Riscos Núñez, Agustín; Verlan, Sergey (Taylor and Francis, 2013)
      This article introduces a general formalism/framework flexible enough to cover descriptions of different variants of P systems having a dynamic membrane structure. Our framework can be useful for the precise definition ...
    • Icon

      Asynchronous and Maximally Parallel Deterministic Controlled Non-Cooperative P Systems Characterize NFIN coNFIN  [Presentation]

      Alhazov, Artiom; Freund, Rudolf (Fénix Editora, 2012)
      Membrane systems (with symbol objects) are distributed controlled multiset processing systems. Non-cooperative P systems with either promoters or inhibitors (of weight not restricted to one) are known to be computationally ...
    • Icon

      Beyond Generalized Multiplicities: Register Machines over Groups  [Presentation]

      Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
      Register machines are a classic model of computing, often seen as a canonical example of a device manipulating natural numbers. In this paper, we de ne register machines operating on general groups instead. This ...
    • Icon

      Complexity of Simulating R Systems by P Systems  [Presentation]

      Alhazov, Artiom; Aman, Bogdan; Freund, Rudolf; Ivanov, Sergiu (Fénix, 2016)
      We show multiple ways to simulate R systems by non-cooperative P systems with atomic control by promoters and/or inhibitors, or with matter-antimatter annihi- lation rules, with a slowdown by a factor of constant. The ...
    • Icon

      Computational Completeness of P Systems Using Maximal Variants of the Set Derivation Mode  [Presentation]

      Alhazov, Artiom; Freund, Rudolf; Verlan, Sergey (Fénix, 2016)
      We consider P systems only allowing rules to be used in at most one copy in each derivation step, especially the variant of the maximally parallel derivation mode where each rule may only be used at most once. Moreover, ...
    • Icon

      Deterministic Non-cooperative P Systems with Strong Context Conditions  [Presentation]

      Alhazov, Artiom; Freund, Rudolf (Fénix Editora, 2015)
      We continue the line of research of deterministic parallel non-cooperative multiset rewriting with control. We here generalize control, i.e., rule applicability context conditions, from promoters and inhibitors checking ...
    • Icon

      Event-Related Outputs of Computations in P Systems  [Presentation]

      Cavaliere, Matteo; Freund, Rudolf; Leitsch, Alexander; Paun, Gheorghe (Fénix Editora, 2005)
      We briefly investigate the idea to consider as the result of a computation in a P system the number of steps elapsed between two events produced during the computation. Specifically, we first consider the case when the ...
    • Icon

      Extended SNP Systems with States  [Presentation]

      Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu (Fénix, 2016)
      We consider (extended) spiking neural P systems with states, where the applicability of rules in a neuron not only depends on the presence of su ciently many spikes (yet in contrast to the standard de nition, no regular ...
    • Icon

      Extended Spiking Neural P systems with Excitatory and Inhibitory Astrocytes  [Presentation]

      Binder, Aneta; Freund, Rudolf; Oswald, Marion; Vock, Lorenz (Fénix Editora, 2007)
      We investigate an extended model of spiking neural P systems incorporating astrocytes and their excitatory or inhibitory influence on axons between neurons. Using very restricted variants of extended spiking neural P ...
    • Icon

      Extended Spiking Neural P Systems with White Hole Rules  [Presentation]

      Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu; Oswald, Marion; Verlan, Sergey (Fénix Editora, 2015)
      We consider extended spiking neural P systems with the additional possibility of so-called \white hole rules", which send the complete contents of a neuron to other neurons, and we show how this extension of the original ...
    • Icon

      How to Go Beyond Turing with P Automata: Time Travels, Regular Observer !-Languages, and Partial Adult Halting  [Presentation]

      Freund, Rudolf; Ivanov, Sergiu; Staiger, Ludwig (Fénix Editora, 2015)
      In this paper we investigate several variants of P automata having in nite runs on nite inputs. By imposing speci c conditions on the in nite evolution of the systems, it is easy to nd ways for going beyond Turing if ...
    • Icon

      Input-Driven Tissue P Automata  [Presentation]

      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

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

      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

      Length P Systems with a Lone Traveler  [Presentation]

      Alhazov, Artiom; Freund, Rudolf; Ivanov, Sergiu (Fénix Editora, 2014)
      In this paper we consider P systems with linear membrane structures (only one membrane is elementary) with at most one object. We raise and attack the question about the computational power of such systems, depending on ...
    • Icon

      Matrix Languages, Register Machines, Vector Addition Systems  [Presentation]

      Freund, Rudolf; Ibarra, Óscar H.; Paun, Gheorghe; Yen, Hsu-Chen (Fénix Editora, 2005)
      We give a direct and simple proof of the equality of Parikh images of lan- guages generated by matrix grammars with appearance checking with the sets of vectors generated by register machines. As a particular case, we ...
    • Icon

      Matter and Anti-Matter in Membrane Systems  [Presentation]

      Alhazov, Artiom; Aman, Bogdan; Freund, Rudolf; Paun, Gheorghe (Fénix Editora, 2014)
      The concept of a matter object being annihilated when meeting its corresponding anti-matter object is investigated in the context of membrane systems, i.e., of (distributed) multiset rewriting systems applying rules in ...
    • Icon

      Membrane division, restricted membrane creation and object complexity in P systems  [Article]

      Alhazov, Artiom; Freund, Rudolf; Riscos Núñez, Agustín (Taylor and Francis, 2006)
      We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursively enumerable sets of vectors of non-negative ...
    • Icon

      Multiset Random Context Grammars, Checkers, and Transducers  [Presentation]

      Cavaliere, Matteo; Freund, Rudolf; Oswald, Marion; Sburlan, Dragos (Fénix Editora, 2006)
      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 ...
    • Icon

      On String Languages Generated by Spiking Neural P Systems  [Presentation]

      Chen, Haiming; Freund, Rudolf; Ionescu, Mihai; Paun, Gheorghe; Pérez Jiménez, Mario de Jesús (Fénix Editora, 2006)
      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 ...