The connection machine
Handbook of Formal Languages
Networks of Parallel Language Processors
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
On the size of computationally complete hybrid networks of evolutionary processors
Theoretical Computer Science
Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof
DNA Computing and Molecular Programming
Theory of Computing Systems
Small universal accepting hybrid networks of evolutionary processors
Acta Informatica
Deciding according to the shortest computations
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Accepting hybrid networks of evolutionary processors
DNA'04 Proceedings of the 10th international conference on DNA computing
Complexity results for deciding Networks of Evolutionary Processors
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we discuss the usage of Accepting Networks of Evolutionary Processors (ANEPs for short) as deciding devices. In this context we define a new halting condition for this model, which seems more coherent with the rest of the theory than the previous such definition, and show that all the computability results reported so far remain valid in the new framework. Moreover, we give a direct and efficient simulation of an arbitrary ANEP by a complete ANEP, thus, showing that the efficiency of deciding a language by ANEPs is not influenced by the network's topology. Finally, we obtain a surprising characterization of PNP[log] as the class of languages that can be decided in polynomial time by ANEPs.