{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T05:43:04Z","timestamp":1768801384841,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T00:00:00Z","timestamp":1529625600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Romanian National Authority for Scientic Research and Innovation","award":["POC P-37-257"],"award-info":[{"award-number":["POC P-37-257"]}]},{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt-Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s11047-018-9691-0","type":"journal-article","created":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T22:08:42Z","timestamp":1529618922000},"page":"799-809","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Small networks of polarized splicing processors are universal"],"prefix":"10.1007","volume":"17","author":[{"given":"Henning","family":"Bordihn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1457-8933","authenticated-orcid":false,"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria C.","family":"Negru","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":[[2018,6,22]]},"reference":[{"key":"9691_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s11047-010-9238-5","volume":"10","author":"P Bottoni","year":"2011","unstructured":"Bottoni P, Labella A, Manea F, Mitrana V, Petre I, Sempere JM (2011) Complexity-preserving simulations among three variants of accepting networks of evolutionary processors. Nat Comput 10:429\u2013445","journal-title":"Nat Comput"},{"key":"9691_CR2","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/s002360050178","volume":"36","author":"E Csuhaj-Varj\u00fa","year":"2000","unstructured":"Csuhaj-Varj\u00fa E, Mitrana V (2000) Evolutionary systems: a language generating device inspired by evolving communities of cells. Acta Inf 36:913\u2013926","journal-title":"Acta Inf"},{"key":"9691_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-62844-4_22","volume":"1218","author":"E Csuhaj-Varj\u00fa","year":"2005","unstructured":"Csuhaj-Varj\u00fa E, Salomaa A (2005) Networks of parallel language processors. New Trends Form Lang LNCS 1218:299\u2013318","journal-title":"New Trends Form Lang LNCS"},{"key":"9691_CR4","first-page":"211","volume":"15","author":"E Csuhaj-Varj\u00fa","year":"1996","unstructured":"Csuhaj-Varj\u00fa E, Kari L, P\u0103un G (1996) Test tube distributed systems based on splicing. Comput Artif Intell 15:211\u2013232","journal-title":"Comput Artif Intell"},{"key":"9691_CR5","first-page":"1598","volume":"13","author":"C Dr\u0103goi","year":"2007","unstructured":"Dr\u0103goi C, Manea F, Mitrana V (2007) Accepting networks of evolutionary processors with filtered connections. J Univers Comput Sci 13:1598\u20131614","journal-title":"J Univers Comput Sci"},{"key":"9691_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-19258-1_4","volume":"9094","author":"S G\u00f3mez-Canaval","year":"2015","unstructured":"G\u00f3mez-Canaval S, Ortega A, Orgaz P (2015a) Distributed simulation of NEPs based on-demand cloud elastic computation. Adv Comput Intell LNCS 9094:40\u201354","journal-title":"Adv Comput Intell LNCS"},{"key":"9691_CR7","first-page":"207","volume":"539","author":"S G\u00f3mez-Canaval","year":"2015","unstructured":"G\u00f3mez-Canaval S, Ordozgoiti B, Mozo A (2015b) NPEPE: massive natural computing engine for optimally solving NP-complete problems in big data scenarios. Commun Comput Inf Sci 539:207\u2013217","journal-title":"Commun Comput Inf Sci"},{"key":"9691_CR8","doi-asserted-by":"crossref","unstructured":"Gray R, Kotz D, Nog S, Rus D, Cybenko G (1997) Mobile agents: the next generation in distributed computing. In: Proceedings of the 2nd AIZU international symposium on parallel algorithms\/architecture synthesis, PAS\u201997. IEEE Computer Society, pp 8\u201324","DOI":"10.1109\/AISPAS.1997.581620"},{"key":"9691_CR9","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T Head","year":"1987","unstructured":"Head T (1987) Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull Math Biol 49:737\u2013759","journal-title":"Bull Math Biol"},{"key":"9691_CR10","first-page":"295","volume":"2","author":"T Head","year":"1996","unstructured":"Head T, P\u0103un G, Pixton D (1996) Language theory and molecular genetics: generative mechanisms suggested by DNA recombination. Handb Form Lang 2:295\u2013360","journal-title":"Handb Form Lang"},{"key":"9691_CR11","volume-title":"Introduction to automata theory, languages and computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages and computation. Addison-Wesley, Reading"},{"key":"9691_CR12","doi-asserted-by":"publisher","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 (2009) On small, reduced, and fast universal accepting networks of splicing processors. Theoret Comput Sci 410:406\u2013416","journal-title":"Theoret Comput Sci"},{"key":"9691_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11925903_4","volume-title":"DNA Computing","author":"Florin Manea","year":"2006","unstructured":"Manea F, Martin-Vide C, Mitrana M (2006) All NP-problems can be solved in polynomial time by accepting networks of splicing processors of constant size. In: International workshop on DNA-based computers DNA12, LNCS, vol 4287, pp 47\u201357"},{"key":"9691_CR14","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2006.10.015","volume":"371","author":"F Manea","year":"2007","unstructured":"Manea F, Martin-Vide C, Mitrana V (2007) Accepting networks of splicing processors: complexity results. Theoret Comput Sci 371:72\u201382","journal-title":"Theoret Comput Sci"},{"key":"9691_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/9789812810908_0025","volume-title":"Words, Semigroups, and Transductions","author":"MAURICE MARGENSTERN","year":"2001","unstructured":"Margenstern M, Rogozhin Y (2001) Time-varying distributed H systems of degree 1 generate all recursively enumerable languages. In: Words, semigroups, and transductions. World Scientific Publishing, Singapore, pp 329\u2013340"},{"key":"9691_CR16","unstructured":"Margenstern M, Mitrana V, Perez-Jimenez M (2005) Accepting hybrid networks of evolutionary systems. In: DNA based computers 10 LNCS, vol 3384, pp 235\u2013246"},{"key":"9691_CR17","first-page":"290","volume-title":"Lecture Notes in Computer Science","author":"C. Mart\u00edn-Vide","year":"2002","unstructured":"Mart\u00edn-Vide C, Pazos J, P\u0103un G, Rodr\u00edguez-Pat\u00f3n A (2002) A new class of symbolic abstract neural nets: tissue P systems. In: 8th annual international conference, COCOON 2002, LNCS, vol 2387, pp 290\u2013299"},{"key":"9691_CR18","doi-asserted-by":"crossref","unstructured":"Minsky ML (1962) Size and structure of universal turing machines using tag systems. In: Recursive function theory, symposium in pure mathematics, vol 5, pp 229\u2013238","DOI":"10.1090\/pspum\/005\/0142452"},{"key":"9691_CR19","first-page":"2010","volume-title":"Flow-based programming: a new approach to application development","author":"JP Morrison","year":"2010","unstructured":"Morrison JP (2010) Flow-based programming: a new approach to application development, 2nd edn. J.P. Enterprises Ltd, Pune, p 2010","edition":"2"},{"key":"9691_CR20","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading"},{"key":"9691_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(96)00101-1","volume":"70","author":"G P\u0103un","year":"1996","unstructured":"P\u0103un G (1996a) On the splicing operation. Discrete Appl Math 70:57\u201379","journal-title":"Discrete Appl Math"},{"key":"9691_CR22","first-page":"27","volume":"1","author":"G P\u0103un","year":"1996","unstructured":"P\u0103un G (1996b) Regular extended H systems are computationally universal. J Autom Lang Combin 1:27\u201336","journal-title":"J Autom Lang Combin"},{"key":"9691_CR23","first-page":"353","volume-title":"Lecture Notes in Computer Science","author":"Gheorghe P\u0103un","year":"1997","unstructured":"P\u0103un G (1997) DNA computing: distributed splicing systems. In: Structures in logic and computer science, LNCS, vol 1261, pp 351\u2013370"},{"key":"9691_CR24","unstructured":"P\u0103un G (1998) Distributed architectures in DNA computing based on splicing: limiting the size of components. In: Unconventional models of computation. Springer, Berlin, pp 323\u2013335"},{"key":"9691_CR25","first-page":"157","volume":"67","author":"A P\u0103un","year":"1999","unstructured":"P\u0103un A (1999) On time-varying H systems. Bull EATCS 67:157\u2013164","journal-title":"Bull EATCS"},{"key":"9691_CR26","doi-asserted-by":"publisher","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"EL Post","year":"1943","unstructured":"Post EL (1943) Formal reductions of the general combinatorial decision problem. Am J Math 65:197\u2013215","journal-title":"Am J Math"},{"key":"9691_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(96)00077-1","volume":"168","author":"Y Rogozhin","year":"1996","unstructured":"Rogozhin Y (1996) Small universal turing machines. Theoret Comput Sci 168:215\u2013240","journal-title":"Theoret Comput Sci"},{"key":"9691_CR28","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.tcs.2008.09.051","volume":"410","author":"D Woods","year":"2009","unstructured":"Woods D, Neary T (2009) The complexity of small universal turing machines: a survey. Theoret Comput Sci 410:443\u2013450","journal-title":"Theoret Comput Sci"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-018-9691-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-9691-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-9691-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T16:45:21Z","timestamp":1569084321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-018-9691-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,22]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["9691"],"URL":"https:\/\/doi.org\/10.1007\/s11047-018-9691-0","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,22]]},"assertion":[{"value":"22 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}