Buscar
Mostrando ítems 11-20 de 33
Ponencia
Priorities, Promoters and Inhibitors in Deterministic Non-Cooperative P Systems
(Fénix Editora, 2014)
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 ...
Ponencia
Extended SNP Systems with States
(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 ...
Ponencia
The Computational Power of Exponential-Space P Systems with Active Membranes
(Fénix Editora, 2012)
We show that exponential-space P systems with active membranes characterize the complexity class EXPSPACE. This result is proved by simulating Turing machines working in exponential space via uniform families of P systems ...
Ponencia
Complexity of Simulating R Systems by P Systems
(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 ...
Ponencia
Catalytic P Systems with Weak Priority of Catalytic Over Non-catalytic Rules
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2020)
Catalytic P systems are among the rst variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particularly the problem ...
Ponencia
Self-Stabilization in Membrane Systems
(Fénix Editora, 2012)
In this paper we study a notion of self-stabilization, inspired from biology and engineering. Multiple variants of formalization of this notion are considered, and we discuss how such properties affect the computational ...
Ponencia
Beyond Generalized Multiplicities: Register Machines over Groups
(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 ...
Ponencia
P Systems: from Anti-Matter to Anti-Rules
(Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
The concept of a matter object being annihilated when meeting its corresponding anti-matter object is taken over for rule labels as objects and anti-rule labels as the corresponding annihilation counterpart in P systems. ...
Ponencia
Polarizationless P Systems with One Active Membrane
(Fénix Editora, 2015)
The aim of this paper is to study the computational power of P systems with one active membrane without polarizations. For P systems with active membranes, it is known that computational completeness can be obtained with ...
Ponencia
Purely Catalytic P Systems over Integers and Their Generative Power
(Fénix, 2016)
We further investigate the computing power of the recently introduced P systems with Z-multisets (also known as hybrid sets) as generative devices. These systems apply catalytic rules in the maximally parallel way, even ...