Buscar
Mostrando ítems 21-30 de 51
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
How to Go Beyond Turing with P Automata: Time Travels, Regular Observer !-Languages, and Partial Adult Halting
(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 ...
Ponencia
(Tissue) P Systems Using Non-cooperative Rules Without Halting Conditions
(Fénix Editora, 2008)
We consider (tissue) P systems using non-cooperative rules, but considering computations without halting conditions. As results of a computation we take the contents of a specified output membrane/cell in each derivation ...
Ponencia
Small Universal Antiport P Systems and Universal Multiset Grammars
(Fénix Editora, 2006)
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 ...
Ponencia
On The Semantics of Annihilation Rules in Membrane Computing
(Fénix Editora, 2015)
It is well known that polarizationless recognizer P systems with active membranes, without dissolution, with division of elementary and non-elementary membranes, with antimatter and matter/antimatter annihilation rules ...
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
Matrix Languages, Register Machines, Vector Addition Systems
(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 ...
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
P Systems with Active Membranes and Two Polarizations
(Fénix Editora, 2004)
P systems with active membranes using only two electrical charges and only rules of types (a) and (c) assigned to at most two membranes are shown to be computationally complete { thus improving the previous result of ...
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 ...