{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:26Z","timestamp":1725665006870},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540628446"},{"type":"electronic","value":"9783540687030"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62844-4_24","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:50:55Z","timestamp":1330296655000},"page":"330-345","source":"Crossref","is-referenced-by-count":2,"title":["On the generative capacity of splicing grammar systems"],"prefix":"10.1007","author":[{"given":"Gianina","family":"Georgescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"226","author":"L. M. Adleman","year":"1994","unstructured":"L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science, 226 (Nov. 1994), 1021\u20131024.","journal-title":"Science"},{"key":"24_CR2","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."},{"key":"24_CR3","unstructured":"E. Csuhaj-Varju, R. Freund, L. Kari, Gh. P\u0103un, DNA computing based on splicing: universality results, First Annual Pacific Symp. on Biocomputing, Hawaii, Jan. 1996."},{"issue":"2\u20133","key":"24_CR4","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\u2013232.","journal-title":"Computers and AI"},{"issue":"2\u20133","key":"24_CR5","first-page":"109","volume":"15","author":"J. Dassow","year":"1996","unstructured":"J. Dassow, V. Mitrana, Splicing grammar systems, Computers and AI, 15, 2\u20133 (1996), 109\u2013122.","journal-title":"Computers and AI"},{"key":"24_CR6","unstructured":"C. Ferretti, S. Kobayashi, T. Yokomori, DNA splicing systems and Post systems, First Annual Pacific Symp. on Biocomputing, Hawaii, Jan. 1996."},{"key":"24_CR7","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":"24_CR8","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1051\/ita\/1991250504731","volume":"25","author":"V. Geffert","year":"1991","unstructured":"V. Geffert, Normal forms for phrase-structure grammars, RAIRO, Th. Inform. and Appl., 25 (1991), 473\u2013496.","journal-title":"RAIRO, Th. Inform. and Appl."},{"key":"24_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":"24_CR10","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-642-58117-5_23","volume-title":"Lindenmayer Systems: Impacts on Theoretical Computer Science and Developmental Biology","author":"T. Head","year":"1992","unstructured":"T. Head, Splicing schemes and DNA, in Lindenmayer Systems: Impacts on Theoretical Computer Science and Developmental Biology (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, 1992, 371\u2013383."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"T. Head, Gh. P\u0103un, D. Pixton, Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination, in Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, 1997.","DOI":"10.1007\/978-3-662-07675-0_7"},{"key":"24_CR12","unstructured":"L. Ilie, A. Salomaa, 2-Testability and relabelings produce everything, submitted, 1995."},{"issue":"1","key":"24_CR13","first-page":"81","volume":"45","author":"V. Mihalache","year":"1996","unstructured":"V. Mihalache, Parallel communicating grammar systems with query words, Ann. Univ. Buc., Matem.-Inform. Series, 45, 1 (1996), 81\u201392.","journal-title":"Ann. Univ. Buc., Matem.-Inform. Series"},{"key":"24_CR14","first-page":"183","volume":"57","author":"G. P\u0103un","year":"1995","unstructured":"Gh. P\u0103un, Splicing. A challenge to formal language theorists, Bulletin EATCS, 57 (1995), 183\u2013194.","journal-title":"Bulletin EATCS"},{"key":"24_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(96)00101-1","volume":"70","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, On the splicing operation, Discrete Appl. Math., 70 (1996), 57\u201379.","journal-title":"Discrete Appl. Math."},{"key":"24_CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207169508804451","volume":"59","author":"G. P\u0103un","year":"1995","unstructured":"Gh. P\u0103un, On the power of the splicing operation, Intern. J. Computer Math., 59 (1995), 27\u201335.","journal-title":"Intern. J. Computer Math."},{"issue":"1","key":"24_CR17","first-page":"27","volume":"1","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, Regular extended H systems are computationally universal, J. Aut. Lang. and Combinatorics, 1, 1 (1996), 27\u201336.","journal-title":"J. Aut. Lang. and Combinatorics"},{"issue":"1","key":"24_CR18","first-page":"93","volume":"55","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, On the power of splicing grammar systems, Ann. Univ. Bucharest. Matem.-Inform. Series, 55, 1 (1996), 93\u2013106.","journal-title":"Ann. Univ. Bucharest. Matem.-Inform. Series"},{"key":"24_CR19","unstructured":"Gh. P\u0103un, Computationally universal distributed systems based on the splicing operation, submitted, 1995."},{"issue":"2","key":"24_CR20","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, Theor. Comp. Science, 168, 2 (1996), 321\u2013336.","journal-title":"Theor. Comp. Science"},{"issue":"3","key":"24_CR21","first-page":"607","volume":"43","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, A. Salomaa, DNA computing based on the splicing operation, Acta Mathematica Japonica, 43, 3 (1996), 607\u2013632.","journal-title":"Acta Mathematica Japonica"},{"key":"24_CR22","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."},{"key":"24_CR23","first-page":"55","volume":"38","author":"G. P\u0103un","year":"1989","unstructured":"Gh. P\u0103un, L. Santean, Parallel communicating grammar systems: the regular case, Ann. Univ. Buc., Matem. Inform. Series, 38 (1989), 55\u201363.","journal-title":"Ann. Univ. Buc., Matem. Inform. Series"},{"key":"24_CR24","first-page":"38","volume-title":"Linear and circular splicing systems","author":"D. Pixton","year":"1995","unstructured":"D. Pixton, Linear and circular splicing systems, Proc. 1st Intern. Symp. on Intell. in Neural and Biological Systems, IEEE, Herndon, 1995, 38\u201345."},{"key":"24_CR25","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa, Formal Languages, Academic Press, New York, London, 1973."},{"key":"24_CR26","volume-title":"Report CSIM 95-01","author":"T. Yokomori","year":"1995","unstructured":"T. Yokomori, S. Kobayashi, C. Ferretti, On the power of circular splicing systems and DNA computability, Report CSIM 95-01, Univ. of Electro-Comm., Chofu, Tokyo, 1995."}],"container-title":["Lecture Notes in Computer Science","New Trends in Formal Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62844-4_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:39:48Z","timestamp":1619573988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62844-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540628446","9783540687030"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-62844-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}