Zobrazeno 1 - 10
of 193
pro vyhledávání: '"Rudolf Freund"'
Autor:
Rudolf Freund
Publikováno v:
Computer Science Journal of Moldova, Vol 32, Iss 3(96), Pp 310-314 (2024)
In the memory of Yurii Rogozhin (November 13, 1949 – March 10, 2014).
Externí odkaz:
https://doaj.org/article/b567af3aad22485b88e4f48308bee251
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 252, Iss Proc. AFL 2017, Pp 11-25 (2017)
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 being enclosed in a vesicle, sending it to a target cell can be indicate
Externí odkaz:
https://doaj.org/article/48c315e5af52496aa014fd997f550abe
Publikováno v:
Computer Science Journal of Moldova, Vol 23, Iss 3(69), Pp 304-328 (2015)
In this paper we focus on two weak forms of cooperation in P systems, namely, catalytic rules and matter/anti-matter annihilation rules. These variants of P systems both are computationally complete, while the corresponding rule complexity turns out
Externí odkaz:
https://doaj.org/article/ce08c230c7c440f08991e0646cdc430e
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 246-260 (2014)
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 distributed grammar systems working in hybrid modes which characterize
Externí odkaz:
https://doaj.org/article/62efb4f077a7488f8965896885b29d8f
Autor:
Rudolf Freund, Gheorghe Păun
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 128, Iss Proc. MCU 2013, Pp 47-61 (2013)
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 of additional control mechanisms. At each step using only multiset rew
Externí odkaz:
https://doaj.org/article/256c5cfd33674ff4adab049ce48b9528
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 128, Iss Proc. MCU 2013, Pp 62-75 (2013)
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 array grammars. First we show that the emptiness problem for P systems
Externí odkaz:
https://doaj.org/article/3b1ad2d02b224bdfaa6794c0976a5485
Publikováno v:
Computer Science Journal of Moldova, Vol 20, Iss 2(59), Pp 133-146 (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 power of multiset rewriting sy
Externí odkaz:
https://doaj.org/article/b58ed2d20fe64263b1b697ce3247cac7
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 88-98 (2010)
In this article, we consider the operations of insertion and deletion working in a graph-controlled manner. We show that like in the case of context-free productions, the computational power is strictly increased when using a control graph: computati
Externí odkaz:
https://doaj.org/article/d6fac98addfd4cd093deec7ee9eda6a6
Autor:
Rudolf Freund, Marian Kogler
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 11, Iss Proc. MeCBIC 2009, Pp 123-135 (2009)
The operations drip and mate considered in (mem)brane computing resemble the operations cut and recombination well known from DNA computing. We here consider sets of vesicles with multisets of objects on their outside membrane interacting by drip and
Externí odkaz:
https://doaj.org/article/d10aa54df9fe4190a695da57ccfa1f7e
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 3, Iss Proc. DCFS 2009, Pp 101-109 (2009)
We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems allows for a unique minimal representation of the generated unary lan
Externí odkaz:
https://doaj.org/article/cb5c0e5f1284470bb25a5d09cfd4b11a