Buscar
Mostrando ítems 21-30 de 49
Ponencia
Maximally Parallel Multiset-Rewriting Systems: Browsing the Configurations
(Fénix Editora, 2005)
The aim of this research is to produce an algorithm for the software that would let a researcher to observe the evolution of maximally parallel multiset-rewriting systems with permitting and forbidding contexts, browsing ...
Ponencia
Uniform Solution to QSAT Using Polarizationless Active Membranes
(Fénix Editora, 2006)
It is known that the satisfiability problem (SAT) can be solved a semi- uniform family of deterministic polarizationless P systems with active membranes with non-elementary membrane division. We present a double improvement ...
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
Evolution-Communication P Systems: Time-Freeness
(Fénix Editora, 2005)
Membrane computing is a (biologically motivated) theoretical framework of distributed parallel computing. If symbol-objects are considered, then membrane sys- tems (also called P systems) are distributed multiset processing ...
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 ...
Ponencia
Computational Completeness of P Systems Using Maximal Variants of the Set Derivation Mode
(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, ...