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 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Castellanos, J., Martin-Vide, C., Mitrana, V., Sempere, J.: Networks of evolutionary processors. Acta Informatica 39, 517–529 (2003)
Castellanos, J., Leupold, P., Mitrana, V.: Descriptional and computational complexity aspects of hybrid networks of evolutionary processors. Theoretical Computer Science 330, 205–220 (2005)
Freund, R., Csuhaj-Varjú, E., Wachtler, F.: Test Tube Systems with Cutting/Recombination Operations. In: Pacific Symposium on BIOCOMPUTING’97, pp. 163–175. World Scientific, Singapore (1997)
Hopcroft, J E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation (1979)
Manea, F., Martin-Vide, C., Mitrana, V.: Accepting networks of splicing processors: Complexity results. Theoretical Computer Science (CiE 2005 special issue) 371(1-2), 72–82 (2007)
Manea, F., Martin-Vide, C., Mitrana, V.: All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size. In: Mao, C., Yokomori, T. (eds.) DNA Computing. LNCS, vol. 4287, pp. 47–57. Springer, Heidelberg (2006)
Margenstern, M., Mitrana, V., Perez-Jimenez, M.: Accepting hybrid networks of evolutionary systems. LNCS, vol. 3384, pp. 235–246. Springer, Heidelberg (2005)
Margenstern, M., Rogozhin, Y.: Time-varying distributed H systems of degree 2 generate all recursively enumerable languages. In: Martin-Vide, C., Mitrana, V. (eds.) Where Mathematics, Computer Science and Biology Meet, Kluwer Academic, Dordrecht (2000)
Margenstern, M., Rogozhin, Y., Verlan, S.: Time-varying distributed H systems of degree 2 can carry out parallel computations. In: DNA8. LNCS, vol. 2568, pp. 326–336. Springer, Heidelberg (2003)
Papadimitriou, C.H.: Computational Complexity (1994)
Păun, Gh.: Regular extended H systems are computationally universal. J. Automata, languages, Combinatorics 1(1), 27–36 (1996)
Păun, A.: On time-varying H systems. Bulletin of the EATCS 67, 157–164 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loos, R. (2007). On Accepting Networks of Splicing Processors of Size 3. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)