Towards a new architecture for symbolic processing
AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Regular extended H systems are computationally universal
Journal of Automata, Languages and Combinatorics
DNA Computing: Distributed Splicing Systems
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Small fast universal turing machines
Theoretical Computer Science
Information Processing Letters
On the size complexity of universal accepting hybrid networks of evolutionary processors
Mathematical Structures in Computer Science
DNA'06 Proceedings of the 12th international conference on DNA Computing
Accepting hybrid networks of evolutionary processors
DNA'04 Proceedings of the 10th international conference on DNA computing
Hi-index | 5.24 |
In this paper, we show that accepting networks of splicing processors (ANSPs) of size 2 are computationally complete. Since, by definition, an ANSP needs at least two nodes to perform non-trivial computations, this completely settles the question of designing complete ANSPs of minimal size. Also, we derive from this result the fact that all the languages in PSPACE can be accepted by ANSPs of size 2, having polynomial length complexity (the ANSP complexity measure for the space used in a computation). However, the construction that we propose, although efficient from the descriptional complexity and space complexity points of view, does not seem to have good properties from the time complexity point of view. In this respect, we prove that ANSPs of size three can decide all languages in NP in polynomial time. The previous lower bound on size for both completeness and efficient acceptance of NP-languages was seven. We also consider ANSPs with restricted features, proving the following normal forms: for any ANSP there exists an equivalent ANSP without input filters, and one without output filters. Finally, we show how to construct a small universal ANSP and make several considerations on the computational efficiency of universal ANSPs.