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 NP in 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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Loos, R. (2007). On accepting networks of splicing processors of size 3. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4497 LNCS, pp. 497–506). https://doi.org/10.1007/978-3-540-73001-9_52
Mendeley helps you to discover research relevant for your work.