{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:23Z","timestamp":1759639043300},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540632467"},{"type":"electronic","value":"9783540692423"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63246-8_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:22:19Z","timestamp":1330298539000},"page":"353-370","source":"Crossref","is-referenced-by-count":13,"title":["DNA computing: Distributed splicing systems"],"prefix":"10.1007","author":[{"given":"Gheorghe","family":"P\u0103un","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"22_CR1","volume-title":"Grammar Systems. A Grammatical Approach to Distribution and Cooperation","author":"E. Csuhaj-Varju","year":"1994","unstructured":"E. Csuhaj-Varju, J. Dassow, J. Kelemen, Gh. P\u0103un, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London, 1994."},{"unstructured":"E. Csuhaj-Varju, L. Freund, L. Kari, Gh. P\u0103un, DNA computing based on splicing: universality results, First Annual Pacific Symp. on Biocomputing, Hawaii, Jan. 1996.","key":"22_CR2"},{"issue":"2\u20133","key":"22_CR3","first-page":"211","volume":"15","author":"E. Csuhaj-Varju","year":"1996","unstructured":"E. Csuhaj-Varju, L. Kari, Gh. P\u0103un, Test tube distributed systems based on splicing, Computers and AI, 15, 2\u20133 (1996), 211\u2013231.","journal-title":"Computers and AI"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","volume":"31","author":"K. Culik II","year":"1991","unstructured":"K. Culik II, T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math., 31 (1991), 261\u2013277.","journal-title":"Discrete Appl. Math."},{"key":"22_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"J. Dassow","year":"1989","unstructured":"J. Dassow, Gh. P\u0103un, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, Heidelberg, 1989."},{"key":"22_CR6","volume-title":"Grammars systems, a chapter in vol. 2 of Handbook of Formal Languages","author":"J. Dassow","year":"1997","unstructured":"J. Dassow, Gh. P\u0103un, G. Rozenberg, Grammars systems, a chapter in vol. 2 of Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Heidelberg, 1997."},{"key":"22_CR7","volume-title":"Grammars with controlled derivations, a chapter in vol. 2 of Handbook of Formal Languages","author":"J. Dassow","year":"1997","unstructured":"J. Dassow, Gh. P\u0103un, A. Salomaa, Grammars with controlled derivations, a chapter in vol. 2 of Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Heidelberg, 1997."},{"unstructured":"R. Freund, L. Kari, Gh. P\u0103un, DNA computing based on splicing: The existence of universal computers, Technical Report 185-2\/FR-2\/95, TU Wien, 1995.","key":"22_CR8"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T. Head","year":"1987","unstructured":"T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology, 49 (1987), 737\u2013759.","journal-title":"Bull. Math. Biology"},{"key":"22_CR10","volume-title":"Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination, a chapter in vol. 2 of Handbook of Formal Languages","author":"T. Head","year":"1996","unstructured":"T. Head, Gh. P\u0103un, D. Pixton, Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination, a chapter in vol. 2 of Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Heidelberg, 1996."},{"doi-asserted-by":"crossref","unstructured":"Gh. P\u0103un, Grammar systems. A grammatical approach to distribution and cooperation, ICALP 1995, LNCS 944 (Z. Fulop, F. Gecseg, eds.), Springer-Verlag, 1995, 429\u2013443.","key":"22_CR11","DOI":"10.1007\/3-540-60084-1_94"},{"issue":"1","key":"22_CR12","first-page":"27","volume":"1","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, Regular extended H systems are computationally universal, J. Automata, Languages, Combinatorics, 1, 1 (1996), 27\u201336.","journal-title":"J. Automata, Languages, Combinatorics"},{"key":"22_CR13","first-page":"144","volume":"60","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, Computing by splicing: How simple rules?, Bulletin of the EATCS, 60 (1996), 144\u2013150.","journal-title":"Bulletin of the EATCS"},{"unstructured":"Gh. P\u0103un, Five (plus two) universal DNA computing models based on the splicing operation, Second DNA Based Computers Workshop, Princeton, 1996, 67\u201386.","key":"22_CR14"},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(96)00097-X","volume":"59","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, Splicing systems with targets are computationally complete, Inform. Processing Letters, Inform. Processing Letters, 59 (1996), 129\u2013133.","journal-title":"Inform. Processing Letters, Inform. Processing Letters"},{"issue":"2","key":"22_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0304-3975(96)00082-5","volume":"168","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, G. Rozenberg, A. Salomaa, Computing by splicing, Theoretical Computer Sci., 168, 2 (1996), 321\u2013336.","journal-title":"Theoretical Computer Sci."},{"key":"22_CR17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(95)00079-7","volume":"69","author":"D. Pixton","year":"1996","unstructured":"D. Pixton, Regularity of splicing languages, Discrete Appl. Math., 69 (1996), 101\u2013124.","journal-title":"Discrete Appl. Math."},{"volume-title":"Handbook of Formal Languages, 3 volumes","year":"1997","unstructured":"G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, 3 volumes, Springer-Verlag, Heidelberg, 1997.","key":"22_CR18"},{"key":"22_CR19","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa, Formal Languages, Academic Press, New York, 1973."},{"doi-asserted-by":"crossref","unstructured":"C. Zandron, C. Ferretti, G. Mauri, A reduced distributed splicing system for RE languages, in vol. Control, Coooperation, Combinatorics. New Trends in Formal Languages (Gh. P\u0103un, A. Salomaa, eds.), LNCS 1218, Springer-Verlag, 1997.","key":"22_CR20","DOI":"10.1007\/3-540-62844-4_23"}],"container-title":["Lecture Notes in Computer Science","Structures in Logic and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63246-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:17:47Z","timestamp":1605647867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63246-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632467","9783540692423"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-63246-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}