Search
Now showing items 1-10 of 49

P Systems with Minimal Insertion and Deletion [Presentation]
(Fénix Editora, 2009)
In this paper we consider insertion-deletion P systems with priority of deletion over the insertion.We show that such systems with one symbol context-free insertion and deletion rules are able to generate PsRE. If one-symbol ...

Partial Versus Total Halting in P Systems [Presentation]
(Fénix Editora, 2007)
We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable anymore at the same time, whereas usually a ...

Dictionary Search and Update by P Systems with String-Objects and Active Membranes [Presentation]
(Fénix Editora, 2009)
Membrane computing is a formal framework of distributed parallel computing. In this paper we implement working with the prefix tree by P systems with strings and active membranes.

Forward and Backward Chaining with P Systems [Presentation]
(Fénix Editora, 2011)
On the one hand, one of the concepts which lies at the basis of membrane computing is the multiset rewriting rule. On the other hand, the paradigm of rules is profusely used in computer science for representing and dealing ...

The Membrane Systems Language Class [Presentation]
(Fénix Editora, 2010)
The aim of this paper is to introduce the class of languages generated by the transitional model of membrane systems without cooperation and without additional ingredients. The fundamental nature of these basic systems ...

A Short Note on Reversibility in P Systems [Presentation]
(Fénix Editora, 2009)
Membrane computing is a formal framework of distributed parallel comput- ing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible ...

The Computational Power of Exponential-Space P Systems with Active Membranes [Presentation]
(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 ...

Priorities, Promoters and Inhibitors in Deterministic Non-Cooperative P Systems [Presentation]
(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 ...

Purely Catalytic P Systems over Integers and Their Generative Power [Presentation]
(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 ...

Semilinear Sets, Register Machines, and Integer Vector Addition (P) Systems [Presentation]
(Fénix, 2016)
In this paper we consider P systems working with multisets with integer multiplicities. We focus on a model in which rule applicability is not in uenced by the contents of the membrane. We show that this variant is ...