In this paper we address the possibility of studying the computational capabilities of catalytic P systems with one catalyst by the means of iterated finite state transducers. We also give a normal form for catalytic P systems.
-
March 30, 2016 (v1)PublicationUploaded on: December 4, 2022
-
March 23, 2016 (v1)Publication
No description
Uploaded on: March 27, 2023 -
March 4, 2016 (v1)Publication
The paper gives several results regarding P systems with non-cooperative rules and promoters/inhibitors at the level of rules. For the class of P systems using inhibitors, generating families of sets of vectors of numbers, the equivalence with the family of Parikh sets of ET0L languages is presented. In case of P systems with non- cooperative...
Uploaded on: March 27, 2023 -
July 9, 2020 (v1)Publication
No description
Uploaded on: December 4, 2022 -
February 1, 2016 (v1)Publication
In this paper we de ne and study Scenario Based P Systems, a model of computation inspired by the metabolic pathways and networks. Starting from the classical de nition of P systems with symbol objects and multiset rewriting rules, we de ne regular expressions able to capture the causal dependencies among di erent executions of the rules. The...
Uploaded on: March 27, 2023 -
March 16, 2016 (v1)Publication
In this paper we investigate some applications of Spiking Neural P Systems regarding their capability to solve some classical computer science problems. In this respect it is studied the versatility of such systems to simulate a well known parallel computational model, namely the Boolean circuits. In addition, another notorious application -...
Uploaded on: December 4, 2022 -
March 16, 2016 (v1)Publication
This paper proposes a new model of P systems where the rules are activated by objects present in the neighboring regions. We obtain the computational completeness considering only two membranes, external inhibitors and carriers. Leaving the carriers apart we obtain equality with ET0L systems in terms of number sets.
Uploaded on: March 27, 2023 -
February 23, 2016 (v1)Publication
This article shows how the computational universality can be reached by using P systems with object rewriting context-free rules, promot- ers/inhibitors and one catalyst. Both generative and accepting cases are stud- ied. Some examples that illustrate the theoretical issues are also presented.
Uploaded on: March 27, 2023 -
February 11, 2016 (v1)Publication
The aim of this paper is to study the power of parallel multiset- rewriting systems with permitting context (or P systems with non-cooperative rules with promoters). The main result obtained is that if we use promoters of weight two, then the system is universal. Moreover, the construction satis¯es a special property we de¯ne: it is...
Uploaded on: March 27, 2023 -
February 11, 2016 (v1)Publication
In cell biology one of the fundamental topic is the study of how biological signals are managed by cells. Signals can arise from inside the cell or from the external environment and the correct answer to certain signals is essential for bacteria to survive in a certain environment. Starting from these biological motivations we consider a model...
Uploaded on: December 4, 2022 -
March 8, 2016 (v1)Publication
We introduce a general model of random context multiset grammars as well as the concept of multiset random context checkers and transducers. Our main results show how recursively enumerable sets of finite multisets can be generated using these models of computing; corresponding results for antiport P systems are established, too.
Uploaded on: December 4, 2022 -
April 2, 2019 (v1)Publication
Membrane computing is a biologically inspired computational paradigm. Motivated by brane calculi we investigate membrane systems which differ from conventional membrane systems by the following features: (1) biomolecules (proteins) can move through the regions of the systems, and can attach onto (and de-attach from) membranes, and (2) membranes...
Uploaded on: December 5, 2022 -
April 2, 2019 (v1)Publication
We consider the idea of controlling the evolution of a membrane system. In particular, we investigate a model of membrane systems using promoted rules, where a string of promoters (called the control string) "travels" through the regions, activating the rules of the system. This control string is present in the skin region at the beginning of...
Uploaded on: March 27, 2023 -
April 2, 2019 (v1)Publication
Membrane computing is a biologically inspired computational paradigm. Motivated by brane calculi we investigate membrane systems which differ from conventional membrane systems by the following features: (1) biomolecules (proteins) can move through the regions of the systems, and can attach onto (and de-attach from) membranes, and (2) membranes...
Uploaded on: March 27, 2023