Abstract: 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 target condition. As soon as a node contains a word which satisfies the target condition of that node, the input word is accepted by the network. In this way, no further output nodes are necessary. Regarding the communication in a network, we consider two cases of control: 1. input and output filters are regular languages, then the target conditions are to belong to certain regular languages, 2. input and output filters are implemented as random context conditions, then the target conditions are given by sets of permitting and forbidding symbols. It is shown in both cases that conventional accepting networks and target based accepting networks have the same computational power. However, the number of processors needed for accepting a language can be reduced when using target based networks.
Keywords: Networks of evolutionary networks, regular filters, random context filters, target based acceptance
