{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:17:16Z","timestamp":1742912236871,"version":"3.40.3"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200279"},{"type":"electronic","value":"9783319200286"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_10","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"95-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universality in Molecular and Cellular Computing"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Verlan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1142\/S0129054111007903","volume":"22","author":"A Alhazov","year":"2011","unstructured":"Alhazov, A., Kogler, M., Margenstern, M., Rogozhin, Y., Verlan, S.: Small universal TVDH and test tube systems. Int. J. Found. Comput. Sci. 22(1), 143\u2013154 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"10_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2009-0031","volume":"91","author":"A Alhazov","year":"2009","unstructured":"Alhazov, A., Mart\u00edn-Vide, C., Truthe, B., Dassow, J., Rogozhin, Y.: On networks of evolutionary processors with nodes of two types. Fundamenta Informaticae 91(1), 1\u201315 (2009)","journal-title":"Fundamenta Informaticae"},{"issue":"07","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1142\/S0129054112400564","volume":"23","author":"A Alhazov","year":"2012","unstructured":"Alhazov, A., Rogozhin, Y., Verlan, S.: On small universal splicing systems. Int. J. Found. Comput. Sci. 23(07), 1423\u20131438 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"17","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.tcs.2010.10.033","volume":"412","author":"A Alhazov","year":"2011","unstructured":"Alhazov, A., Verlan, S.: Minimization strategies for maximally parallel multiset rewriting systems. Theor. Comput. Sci. 412(17), 1581\u20131591 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR5","first-page":"42","volume":"1","author":"IM Barzdin","year":"1963","unstructured":"Barzdin, I.M.: On a class of turing machines (Minsky machines). Algebra i Logika 1, 42\u201351 (1963). (in Russian)","journal-title":"Algebra i Logika"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-22993-0_16","volume-title":"Mathematical Foundations of Computer Science 2011","author":"R Bonnet","year":"2011","unstructured":"Bonnet, R.: The reachability problem for vector addition system with one zero-test. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 145\u2013157. Springer, Heidelberg (2011)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/3-540-45720-8_74","volume-title":"Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence","author":"J Castellanos","year":"2001","unstructured":"Castellanos, J., Mart\u00edn-Vide, C., Mitrana, V., Sempere, J.M.: Solving NP-complete problems with networks of evolutionary processors. In: Mira, J., Prieto, A.G. (eds.) IWANN 2001. LNCS, vol. 2084, pp. 621\u2013628. Springer, Heidelberg (2001)"},{"issue":"2\u20133","key":"10_CR8","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. Artif. Intell. 15(2\u20133), 211\u2013232 (1996)","journal-title":"Comput. Artif. Intell."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Dassow, J., Manea, F.: Accepting hybrid networks of evolutionary processors with special topologies and small communication. In: Proceedings of DCFS 2010, of EPTCS, vol. 31, pp. 68\u201377 (2010)","DOI":"10.4204\/EPTCS.31.9"},{"issue":"1\u20132","key":"10_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2015-1142","volume":"136","author":"J Dassow","year":"2015","unstructured":"Dassow, J., Manea, F., Truthe, B.: On the power of accepting networks of evolutionary processors with special topologies and random context filters. Fundamenta Informaticae 136(1\u20132), 1\u201335 (2015)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-04186-0_9","volume-title":"Transactions on Computational Systems Biology XI","author":"J Dassow","year":"2009","unstructured":"Dassow, J., Mitrana, V.: Accepting networks of non-inserting evolutionary processors. In: Priami, C., Back, R.-J., Petre, I. (eds.) Transactions on Computational Systems Biology XI. LNCS, vol. 5750, pp. 187\u2013199. Springer, Heidelberg (2009)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-662-43948-7_31","volume-title":"Automata, Languages, and Programming","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., Demaine, M.L., Fekete, S.P., Patitz, M.J., Schweller, R.T., Winslow, A., Woods, D.: One tile to rule them all: simulating any tile assembly system with a single universal tile. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 368\u2013379. Springer, Heidelberg (2014)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Doty, D., Lutz, J.H., Patitz, M.J., Schweller, R.T., Summers, S.M., Woods, D.: The tile assembly model is intrinsically universal. In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 302\u2013310 (2012)","DOI":"10.1109\/FOCS.2012.76"},{"key":"10_CR14","first-page":"259","volume-title":"8th International Workshop on Descriptional Complexity of Formal Systems","author":"R Freund","year":"2006","unstructured":"Freund, R., Oswald, M.: A small universal antiport P system with forbidden context. In: Leung, H., Pighizzini, G. (eds.) 8th International Workshop on Descriptional Complexity of Formal Systems, pp. 259\u2013266. Proceedings, New Mexico (2006)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-77312-2_17","volume-title":"Membrane Computing","author":"R Freund","year":"2007","unstructured":"Freund, R., Verlan, S.: A formal framework for static (Tissue) P systems. In: Eleftherakis, G., Kefalas, P., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 271\u2013284. Springer, Heidelberg (2007)"},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0304-3975(02)00658-8","volume":"296","author":"P Frisco","year":"2003","unstructured":"Frisco, P.: Direct constructions of universal extended H systems. Theor. Comput. Sci. 296(2), 269\u2013293 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"10_CR17","first-page":"103","volume":"49","author":"P Frisco","year":"2002","unstructured":"Frisco, P., Hoogeboom, H.J., Sant, P.: A direct construction of a universal P system. Fundamenta Informaticae 49(1\u20133), 103\u2013122 (2002)","journal-title":"Fundamenta Informaticae"},{"issue":"6","key":"10_CR18","doi-asserted-by":"publisher","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(6), 737\u2013759 (1987)","journal-title":"Bull. Math. Biol."},{"key":"10_CR19","series-title":"Theory and Experiments","first-page":"158","volume-title":"Computing with Bio-Molecules","author":"T Head","year":"1998","unstructured":"Head, T.: Splicing languages generated with one sided context. In: Paun, G. (ed.) Computing with Bio-Molecules. Theory and Experiments, pp. 158\u2013181. Springer, Singapore (1998)"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8(2), 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Ivanov, S., Pelz, E., Verlan, S.: Small universal Petri nets with inhibitor arcs (2013). arXiv, CoRR. abs\/1312.4414","DOI":"10.1007\/978-3-319-09704-6_17"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-319-09704-6_17","volume-title":"Descriptional Complexity of Formal Systems","author":"S Ivanov","year":"2014","unstructured":"Ivanov, S., Pelz, E., Verlan, S.: Small universal non-deterministic Petri nets with inhibitor arcs. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 186\u2013197. Springer, Heidelberg (2014)"},{"issue":"1\u2014-4","key":"10_CR23","first-page":"133","volume":"19","author":"S Ivanov","year":"2014","unstructured":"Ivanov, S., Rogozhin, Y., Verlan, S.: Small universal networks of evolutionary processors. J. Autom. Lang. Comb. 19(1\u2014-4), 133\u2013144 (2014)","journal-title":"J. Autom. Lang. Comb."},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF03024425","volume":"19","author":"L Kari","year":"1997","unstructured":"Kari, L.: DNA computing: arrival of biological mathematics. Math. Intell. 19(2), 9\u201322 (1997)","journal-title":"Math. Intell."},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1038\/msb4100099","volume":"2","author":"J Kim","year":"2006","unstructured":"Kim, J., White, K.S., Winfree, E.: Construction of an in vitro bistable circuit from synthetic transcriptional switches. Mol. Syst. Biol. 2, 68 (2006)","journal-title":"Mol. Syst. Biol."},{"issue":"2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0304-3975(96)00080-1","volume":"168","author":"I Korec","year":"1996","unstructured":"Korec, I.: Small universal register machines. Theor. Comput. Sci. 168(2), 267\u2013301 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-88282-4_31","volume-title":"Language and Automata Theory and Applications","author":"A Krassovitskiy","year":"2008","unstructured":"Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Further results on insertion-deletion systems with one-sided contexts. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 333\u2013344. Springer, Heidelberg (2008)"},{"issue":"3","key":"10_CR28","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s00224-010-9252-0","volume":"48","author":"JI Lathrop","year":"2011","unstructured":"Lathrop, J.I., Lutz, J.H., Patitz, M.J., Summers, S.M.: Computability and complexity in self-assembly. Theory Comput. Syst. 48(3), 617\u2013647 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"45","key":"10_CR29","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.: On small, reduced, and fast universal accepting networks of splicing processors. Theor. Comp. Sci. 410(45), 406\u2013416 (2009)","journal-title":"Theor. Comp. Sci."},{"key":"10_CR30","volume-title":"Algorithms and Recursive Functions","author":"AI Malcev","year":"1970","unstructured":"Malcev, A.I.: Algorithms and Recursive Functions. Wolters-Noordhoff, Groningen (1970)"},{"key":"10_CR31","first-page":"17:753","volume":"8","author":"F Manea","year":"2007","unstructured":"Manea, F., Mart\u00edn-Vide, C., Mitrana, V.: On the size complexity of universal accepting hybrid networks of evolutionary processors. Math. Struct. Comput. Sci. 8, 17:753\u2013771 (2007)","journal-title":"Math. Struct. Comput. Sci."},{"key":"10_CR32","first-page":"525","volume-title":"Accepting Networks of Evolutionary Word and Picture Processors: A Survey","author":"F Manea","year":"2010","unstructured":"Manea, F., Mart\u00edn-Vide, C., Mitrana, V.: Accepting Networks of Evolutionary Word and Picture Processors: A Survey, pp. 525\u2013561. Imperial College Press, London (2010). Chap. 10"},{"issue":"2","key":"10_CR33","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(99)00102-4","volume":"231","author":"M Margenstern","year":"2000","unstructured":"Margenstern, M.: Frontier between decidability and undecidability: a survey. Theor. Comput. Sci. 231(2), 217\u2013251 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/9789812810908_0025","volume-title":"Words, Semigroups, and Transductions","author":"M Margenstern","year":"2001","unstructured":"Margenstern, M., Rogozhin, Y.: Time-varying distributed H systems of degree 1 generate all recursively enumerable languages. In: Ito, M., P\u0103un, G., Yu, S. (eds.) Words, Semigroups, and Transductions, pp. 329\u2013339. World Scientific, Singapore (2001)"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-24628-2_6","volume-title":"DNA Computing","author":"M Margenstern","year":"2004","unstructured":"Margenstern, M., Rogozhin, Y., Verlan, S.: Time-varying distributed H systems with parallel computations: the problem is solved. In: Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol. 2943, pp. 48\u201353. Springer, Heidelberg (2004)"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-74593-8_18","volume-title":"Machines, Computations, and Universality","author":"A Matveevici","year":"2007","unstructured":"Matveevici, A., Rogozhin, Y., Verlan, S.: Insertion-deletion systems with one-sided contexts. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 205\u2013217. Springer, Heidelberg (2007)"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Minsky, M.: Size and structure of universal Turing machines using tag systems. In: Recursive Function Theory: Proceedings, Symposium in Pure Mathematics, vo. 5, pp. 229\u2013238. Provelence (1962)","DOI":"10.1090\/pspum\/005\/0142452"},{"key":"10_CR38","volume-title":"Computations: Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M.: Computations: Finite and Infinite Machines. Prentice Hall, USA (1967)"},{"key":"10_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-642-27660-6_32","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"T Neary","year":"2012","unstructured":"Neary, T., Woods, D.: The complexity of small universal turing machines: a survey. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 385\u2013405. Springer, Heidelberg (2012)"},{"key":"10_CR40","unstructured":"Ollinger, N.: Automates cellulaires: structures. Ph.D. thesis, ENS Lyon (2002)"},{"key":"10_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-45465-9_28","volume-title":"Automata, Languages and Programming","author":"N Ollinger","year":"2002","unstructured":"Ollinger, N.: The quest for small universal cellular automata. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 318\u2013329. Springer, Heidelberg (2002)"},{"key":"10_CR42","unstructured":"Patil, S.S.: Coordination of asynchronous events. Ph.D. thesis, MIT (1970)"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-540-85194-3_17","volume-title":"Unconventional Computation","author":"MJ Patitz","year":"2008","unstructured":"Patitz, M.J., Summers, S.M.: Self-assembly of decidable sets. In: Calude, C.S., Costa, J.F., Freund, R., Oswald, M., Rozenberg, G. (eds.) UC 2008. LNCS, vol. 5204, pp. 206\u2013219. Springer, Heidelberg (2008)"},{"issue":"61","key":"10_CR44","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"1","author":"G P\u0103un","year":"2000","unstructured":"P\u0103un, G.: Computing with membranes. J. Comput. Syst. Sci. 1(61), 108\u2013143 (2000). Also TUCS Report No. 208, 1998","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing: An Introduction","author":"G P\u0103un","year":"2002","unstructured":"P\u0103un, G.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)"},{"key":"10_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"G P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)"},{"key":"10_CR47","volume-title":"The Oxford Handbook Of Membrane Computing","author":"G P\u0103un","year":"2009","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook Of Membrane Computing. Oxford University Press, New York (2009)"},{"key":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-18305-8_12","volume-title":"DNA Computing and Molecular Programming","author":"L Qian","year":"2011","unstructured":"Qian, L., Soloveichik, D., Winfree, E.: Efficient turing-universal computation with DNA polymers. In: Sakakibara, Y., Mi, Y. (eds.) DNA 16 2010. LNCS, vol. 6518, pp. 123\u2013140. Springer, Heidelberg (2011)"},{"issue":"2","key":"10_CR49","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.: Small universal turing machines. Theor. Comput. Sci. 168(2), 215\u2013240 (1996)","journal-title":"Theor. Comput. Sci."},{"volume-title":"Handbook of Natural Computing","year":"2012","key":"10_CR50","unstructured":"Rozenberg, G., B\u00e4ck, T., Kok, J.N. (eds.): Handbook of Natural Computing. Springer, Heidelberg (2012)"},{"key":"10_CR51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07675-0","volume-title":"Handbook of Formal Languages","author":"G Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Heidelberg (1997)"},{"key":"10_CR52","volume-title":"A two counter machine cannot calculate 2N","author":"R Schroeppel","year":"1972","unstructured":"Schroeppel, R.: A two counter machine cannot calculate 2N. AI Memos, Cambridge (1972)"},{"issue":"5805","key":"10_CR53","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1126\/science.1132493","volume":"314","author":"G Seelig","year":"2006","unstructured":"Seelig, G., Soloveichik, D., Zhang, D.Y., Winfree, E.: Enzyme-free nucleic acid logic circuits. Science 314(5805), 1585\u20131588 (2006)","journal-title":"Science"},{"key":"10_CR54","first-page":"157","volume":"34","author":"CE Shannon","year":"1956","unstructured":"Shannon, C.E.: A universal Turing machine with two internal states. Autom. Stud. Ann. Math. Stud. 34, 157\u2013165 (1956)","journal-title":"Autom. Stud. Ann. Math. Stud."},{"issue":"6","key":"10_CR55","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D Soloveichik","year":"2007","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM J. Comput. 36(6), 1544\u20131569 (2007)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10_CR56","first-page":"230","volume":"42","author":"AM Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 42(2), 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."},{"key":"10_CR57","unstructured":"Verlan, S.: Study of language-theoretic computational paradigms inspired by biology. Habilitation thesis, Universit\u00e9 Paris Est (2010)"},{"key":"10_CR58","unstructured":"von Neumann, J.: Theory of self-reproducing automata. University of Illinois (1966)"},{"issue":"4","key":"10_CR59","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1145\/321088.321090","volume":"8","author":"S Watanabe","year":"1961","unstructured":"Watanabe, S.: 5-symbol 8-state and 5-symbol 6-state universal turing machines. J. ACM 8(4), 476\u2013483 (1961)","journal-title":"J. ACM"},{"key":"10_CR60","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, Caltech (1998)"},{"key":"10_CR61","volume-title":"A New Kind of Science","author":"S Wolfram","year":"2002","unstructured":"Wolfram, S.: A New Kind of Science. Wolfram Media Inc., UK (2002)"},{"issue":"7","key":"10_CR62","doi-asserted-by":"publisher","first-page":"9397","DOI":"10.4249\/scholarpedia.9397","volume":"5","author":"R Zizza","year":"2010","unstructured":"Zizza, R.: Splicing systems. Scholarpedia 5(7), 9397 (2010)","journal-title":"Scholarpedia"}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:33:35Z","timestamp":1676025215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}