On Accepting Networks of Splicing Processors of Size 3

Authors:
Remco Loos
Affiliations:
Research Group on Mathematical Linguistics, Rovira i Virgili University, Pça Imperial Tàrraco 1, 43005 Tarragona, Spain
Venue:
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Year:
2007

Citing 7
Cited 0

Regular extended H systems are computationally universal

Journal of Automata, Languages and Combinatorics
Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages

Where mathematics, computer science, linguistics and biology meet
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
On the size complexity of hybrid networks of evolutionary processors

Theoretical Computer Science - Descriptional complexity of formal systems
Accepting networks of splicing processors: Complexity results

Theoretical Computer Science
All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show that accepting networks of splicing processors (ANSPs) of size 3 are computationally complete. Moreover, we prove that they can decide all languages in NPin polynomial time. The previous lower bound for both issues was 7. Since, by its definition, ANSPs need at least 2 nodes for any non-trivial computation, we leave only one open case. We also prove the following normal form: For any ANSP there exists an equivalent ANSP without output filters.