45 citations · 66 across the 9 of their papers we have counts for
8 papers · 1 filter
A P Systems Variant for Reasoning about Sequential Controllability of Boolean Networks
Artiom Alhazov, Vincent Ferrari-Dominguez, Rudolf Freund +2
A Boolean network is a discrete dynamical system operating on vectors of Boolean variables. The action of a Boolean network can be conveniently expressed as a system of Boolean upd…
P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks
Artiom Alhazov, Rudolf Freund, Sergiu Ivanov
Membrane computing and P systems are a paradigm of massively parallel natural computing introduced by Gheorghe Păun in 1999, inspired by the structure of the living cell and by its…
(Tissue) P Systems with Vesicles of Multisets
Artiom Alhazov, Rudolf Freund, Sergiu Ivanov +1
We consider tissue P systems working on vesicles of multisets with the very simple operations of insertion, deletion, and substitution of single objects. With the whole multiset be…
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes
Henning Fernau, Rudolf Freund, Markus Holzer
We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating…
One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules
Rudolf Freund, Sergiu Ivanov, Marion Oswald +1
We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in a…
How to Obtain Computational Completeness in P Systems with One Catalyst
Rudolf Freund, Gheorghe Păun
Whether P systems with only one catalyst can already be computationally complete, is still an open problem. Here we establish computational completeness by using specific variants…