Simulating Accepting Networks of Evolutionary Processors with Filtered Connections by Accepting Evolutionary P Systems - (Extended Abstract)
نویسندگان
چکیده
In this work, we propose a variant of P system based on the rewriting of string-objects by means of evolutionary rules. The membrane structure of such a P system seems to be a very natural tool for simulating the filters in accepting networks of evolutionary processors with filtered connections. We discuss an informal construction supporting this simulation. A detailed proof is to be considered in an extended version of this work.
منابع مشابه
Simulating Accepting Networks of Evolutionary Processors with Filtered Connections by Accepting Evolutionary P Systems
In this work, we propose a variant of P system based on the rewriting of string-objects by means of evolutionary rules. The membrane structure of such a P system seems to be a very natural tool for simulating the filters in accepting networks of evolutionary processors with filtered connections. We discuss an informal construction supporting this simulation. A detailed proof is to be considered...
متن کاملSmall Universal Accepting Networks of Evolutionary Processors with Filtered Connections
In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs). We show that there are universal ANEPFCs of size 10, by devising a method for simulating 2-Tag Systems. This result significantly improves the known upper bound for the size of universal ANEPFCs which is 18. We also propose a new, computation...
متن کاملAccepting Networks of Evolutionary Processors with Filtered Connections
In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that input and output filters, respectively, of the two nodes connected by the edge coincide. Thus, the possibility of controlling the computation in ...
متن کاملTarget Based Accepting Networks of Evolutionary Processors with Regular Filters
In this paper, a new definition of accepting networks – called target based accepting networks – is given. In a target based accepting network of evolutionary processors, each node is equipped with a regular language – the target set. As soon as a node contains a word of its target set, the input word is accepted by the network. In this way, no further output nodes are necessary. It is shown th...
متن کاملOn the size complexity of hybrid networks of evolutionary processors
The goal of this paper is twofold. Firstly, to survey in a systematic and uniform way the main results regarding the size descriptional complexity measures of hybrid networks of evolutionary processors as generating devices. Secondly, we improve some results about the size measure, prove that it is connected, and discuss the possibility of computing this measure for regular and context-free lan...
متن کامل