{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:55:58Z","timestamp":1676026558106},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00658-8","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T16:25:27Z","timestamp":1045499127000},"page":"269-293","source":"Crossref","is-referenced-by-count":2,"title":["Direct constructions of universal extended H systems"],"prefix":"10.1016","volume":"296","author":[{"given":"Pierluigi","family":"Frisco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00658-8_BIB1","unstructured":"G. Alford, Explicitly constructing universal extended H systems, in: Calude, et al. (Eds.), Proc. 1st Internat. Conf. on Unconventional Models of Computation, Auckland, New Zealand, 5\u201311 January 1998, http:\/\/www.cs.auckland.ac.nz\/CDMTCS\/docs\/umc98\/."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB2","series-title":"Proc. 1st Ann. Pacific Symp. in Biocomputing, Hawaii, 1996","first-page":"179","article-title":"DNA computing based on splicing: universality results","author":"Csuhaj-Varju","year":"1996"},{"key":"10.1016\/S0304-3975(02)00658-8_BIB3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1080\/00207168908803715","article-title":"On the undecidability of splicing systems","volume":"27","author":"Denninghoff","year":"1989","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB4","unstructured":"C. Ferretti, G. Mauri, S. Kobayashi, T. Yokomori, On the universality of Post and splicing systems, in: L. Hunter, T. Klein (Eds.), Biocomputing: Proc. 1996 Pacific Symp., World Scientific Publishing Co., Singapore, January 1996, ISBN 981-02-2578-4, pp. 288\u2013299."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB5","unstructured":"R. Freund, F. Freund, M. Oswald, Universal H systems using multisets, Manuscript, 1997."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB6","unstructured":"R. Freund, L. Kari. G. P\u0103un, DNA computing based on splicing, The existence of universal computers, Tech. Report 185-2\/FR-2\/95, Technical University, Wien, 1995, and Theories Comput. Sci. 32 (1999) 69\u2013122."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB7","unstructured":"P. Frisco, A Direct Construction of a Universal Extended H System, Machine, Computations and Universality (MCU), in: Proc. Internat. Conf. MCU 2001, Chisinau, Moldova, May 2001, Lecture Notes in Computer Science, Vol. 2055, Springer, Berlin, pp. 226\u2013239."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB8","unstructured":"P. Frisco, H.J. Hoogeboom. P. Sant, A direct construction of a Universal P, in: Workshop on Multiset Processing, Curtea de Arges, Romania, August 2001."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB9","series-title":"Computing with Bio-Molecules, Theory and Experiments","first-page":"221","article-title":"Simulating Turing machines by extended mH systems","author":"Frisco","year":"1998"},{"key":"10.1016\/S0304-3975(02)00658-8_BIB10","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","article-title":"Formal language theory and DNA","volume":"49","author":"Head","year":"1987","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(96)00101-1","article-title":"On the splicing operation","volume":"70","author":"P\u0103un","year":"1996","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/S0304-3975(02)00658-8_BIB12","first-page":"27","article-title":"Regular extended H systems are computationally universal","volume":"1","author":"P\u0103un","year":"1996","journal-title":"J. Automata, Languages, Combinatorics"},{"key":"10.1016\/S0304-3975(02)00658-8_BIB13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(96)00097-X","article-title":"Splicing systems with targets are computationally complete","volume":"59","author":"P\u0103un","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB14","unstructured":"Gh. P\u0103un, DNA computing based on splicing: universality results, in: Proc. 2nd Internat. Colloq. on Universal Machines and Computations, Metz, 1998, Vol. I, pp. 67\u201391."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB15","doi-asserted-by":"crossref","unstructured":"Gh. P\u0103un, G. Rozenberg, A. Salomaa, Computing by splicing. Programmed and evolving splicing systems, IEEE Internat. Conf. on Evolutionary Computing, Indianapolis, 1997, pp. 273\u2013277.","DOI":"10.1007\/978-3-662-03563-4_8"},{"key":"10.1016\/S0304-3975(02)00658-8_BIB16","series-title":"DNA Computing","author":"P\u0103un","year":"1998"},{"key":"10.1016\/S0304-3975(02)00658-8_BIB17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/00207169608804472","article-title":"Restricted use of the splicing operation","volume":"60","author":"P\u0103un","year":"1996","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0304-3975(96)00077-1","article-title":"Small universal Turing machines","volume":"168","author":"Rogozhin","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB19","first-page":"157","article-title":"A universal Turing machine with two internal states","volume":"34","author":"Shannon","year":"1956","journal-title":"Automata Stud. Ann. Math. Stud."},{"key":"10.1016\/S0304-3975(02)00658-8_BIB20","unstructured":"A.M. Turing, On computable numbers, with an application to the Entscheidungsproblem, in: Proc. London Math. Soc. Ser. 2 42 (1936) 230\u2013265; A correction 43 (1936) 544\u2013546."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006588?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006588?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T04:11:11Z","timestamp":1583986271000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502006588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502006588"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00658-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}