{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T18:43:45Z","timestamp":1757702625661,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319710686"},{"type":"electronic","value":"9783319710693"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71069-3_13","type":"book-chapter","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T22:42:41Z","timestamp":1510958561000},"page":"165-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Networks of Polarized Splicing Processors"],"prefix":"10.1007","author":[{"given":"Henning","family":"Bordihn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihaela","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,19]]},"reference":[{"key":"13_CR1","first-page":"211","volume":"15","author":"E Csuhaj-Varj\u00fa","year":"1996","unstructured":"Csuhaj-Varj\u00fa, E., Kari, L., P\u0103un, G.: Test tube distributed systems based on splicing. Comput. AI 15, 211\u2013232 (1996)","journal-title":"Comput. AI"},{"issue":"11","key":"13_CR2","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1007\/s002360050178","volume":"36","author":"E Csuhaj-Varj\u00fa","year":"2000","unstructured":"Csuhaj-Varj\u00fa, E., Mitrana, V.: Evolutionary systems: A language generating device inspired by evolving communities of cells. Acta Informatica 36(11), 913\u2013926 (2000)","journal-title":"Acta Informatica"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-62844-4_22","volume-title":"New Trends in Formal Languages","author":"E Csuhaj-Varj\u00fa","year":"1997","unstructured":"Csuhaj-Varj\u00fa, E., Salomaa, A.: Networks of parallel language processors. In: P\u0103un, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 299\u2013318. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62844-4_22"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Gray, R., Kotz, D., Nog, S., Rus, D., Cybenko, G.: Mobile agents: the next generation in distributed computing. In: Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms\/Architecture Synthesis, PAS 1997, pp. 8\u201324. IEEE Computer Society (1997)","DOI":"10.1109\/AISPAS.1997.581620"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T Head","year":"1987","unstructured":"Head, T.: Formal language theory and dna: An analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biol. 49, 737\u2013759 (1987)","journal-title":"Bull. Math. Biol."},{"key":"13_CR6","volume-title":"Introduction to Automata Theory","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory. Addison Wesley, Languages and Computation (1979)"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.tcs.2008.09.048","volume":"410","author":"R Loos","year":"2009","unstructured":"Loos, R., Manea, F., Mitrana, V.: On small, reduced, and fast universal accepting networks of splicing processors. Theoret. Comput. Sci. 410, 406\u2013416 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.tcs.2006.10.015","volume":"371","author":"F Manea","year":"2007","unstructured":"Manea, F., Mart\u00edn-Vide, C., Mitrana, V.: Accepting networks of splicing processors: Complexity results. Theoret. Comput. Sci. 371, 72\u201382 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Margenstern, M., Rogozhin, Y.: Time-varying distributed h systems of degree 1 generate all recursively enumerable languages. In: Words, Semigroups, and Transductions, pp. 329\u2013340. World Scientific (2001)","DOI":"10.1142\/9789812810908_0025"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-45655-4_32","volume-title":"Computing and Combinatorics","author":"C Mart\u00edn-Vide","year":"2002","unstructured":"Mart\u00edn-Vide, C., Pazos, J., P\u0103un, G., Rodr\u00edguez-Pat\u00f3n, A.: A new class of symbolic abstract neural nets: tissue P systems. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 290\u2013299. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45655-4_32"},{"key":"13_CR11","unstructured":"Morrison, J.P.: Flow-Based Programming: A New Approach to Application Development. J.P. Enterprises Ltd. (2010)"},{"key":"13_CR12","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"13_CR13","first-page":"157","volume":"67","author":"A P\u0103un","year":"1999","unstructured":"P\u0103un, A.: On time-varying H systems. Bull. EATCS 67, 157\u2013164 (1999)","journal-title":"Bull. EATCS"},{"key":"13_CR14","first-page":"27","volume":"1","author":"G P\u0103un","year":"1996","unstructured":"P\u0103un, G.: Regular extended H systems are computationally universal. J. Automata Lang. Comb. 1, 27\u201336 (1996)","journal-title":"J. Automata Lang. Comb."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-63246-8_22","volume-title":"Structures in Logic and Computer Science","author":"G P\u0103un","year":"1997","unstructured":"P\u0103un, G.: DNA computing: distributed splicing systems. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol. 1261, pp. 353\u2013370. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63246-8_22"},{"key":"13_CR16","unstructured":"P\u0103un, G.: Distributed architectures in DNA computing based on splicing: limiting the size of components. In: Unconventional Models of Computation, pp. 323\u2013335. Springer (1998)"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71069-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T05:23:01Z","timestamp":1570339381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-71069-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319710686","9783319710693"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71069-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}