{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:12Z","timestamp":1759639032229},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0020-0190(96)00097-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:22:55Z","timestamp":1027610575000},"page":"129-133","source":"Crossref","is-referenced-by-count":11,"title":["Splicing systems with targets are computationally universal"],"prefix":"10.1016","volume":"59","author":[{"given":"Gheorghe","family":"P\u0103un","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2\u20133","key":"10.1016\/0020-0190(96)00097-X_BIB1","article-title":"Test tube distributed systems based on splicing","volume":"15","author":"Csuhaj-Varju","year":"1996","journal-title":"Computers and AI"},{"key":"10.1016\/0020-0190(96)00097-X_BIB2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","article-title":"Splicing semigroups of dominoes and DNA","volume":"31","author":"Culik","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(96)00097-X_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\/0020-0190(96)00097-X_BIB4","doi-asserted-by":"crossref","unstructured":"R. Freund, L. Kari and G. P\u0103un, DNA computing based on splicing: The existence of universal computers, J. ACM, to appear.","DOI":"10.1007\/s002240000112"},{"key":"10.1016\/0020-0190(96)00097-X_BIB5","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/0020-0190(96)00097-X_BIB6","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","article-title":"Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors","volume":"49","author":"Head","year":"1987","journal-title":"Bull. Math. Biology"},{"key":"10.1016\/0020-0190(96)00097-X_BIB7","article-title":"Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination","author":"Head","year":"1996"},{"key":"10.1016\/0020-0190(96)00097-X_BIB8","series-title":"Genetic Algorithms: The Movie","author":"Koza","year":"1992"},{"key":"10.1016\/0020-0190(96)00097-X_BIB9","first-page":"183","article-title":"Splicing, A challenge to formal language theorists","volume":"57","author":"P\u0103un","year":"1995","journal-title":"Bull. EATCS"},{"key":"10.1016\/0020-0190(96)00097-X_BIB10","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\/0020-0190(96)00097-X_BIB11","article-title":"Regular extended H systems are computationally universal","volume":"1","author":"P\u0103un","year":"1996","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"10.1016\/0020-0190(96)00097-X_BIB12","series-title":"2nd Ann. DNA Computing Workshop","article-title":"Five (plus two) universal DNA computing models based on the splicing operation","author":"P\u0103un","year":"1996"},{"key":"10.1016\/0020-0190(96)00097-X_BIB13","series-title":"Computationally universal distributed systems based on the splicing operation","author":"P\u0103un","year":"1995"},{"key":"10.1016\/0020-0190(96)00097-X_BIB14","doi-asserted-by":"crossref","unstructured":"G. P\u0103un, Computing by splicing: How simple rules?, Bull. EATCS, to appear.","DOI":"10.1016\/S0304-3975(96)00082-5"},{"key":"10.1016\/0020-0190(96)00097-X_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(96)00082-5","article-title":"Computing by splicing","author":"P\u0103un","year":"1996","journal-title":"Theoret. Computer Sci."},{"key":"10.1016\/0020-0190(96)00097-X_BIB16","unstructured":"G. P\u0103un, G. Rozenberg and A. Salomaa, Restricted use of the splicing operation, Internat. J. Comput. Math., to appear."},{"key":"10.1016\/0020-0190(96)00097-X_BIB17","article-title":"DNA computing based on the splicing operation","author":"P\u0103un","year":"1996","journal-title":"Math. Japon."},{"key":"10.1016\/0020-0190(96)00097-X_BIB18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(95)00079-7","article-title":"Regularity of splicing languages","volume":"69","author":"Pixton","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(96)00097-X_BIB19","article-title":"On the power of circular splicing systems and DNA computability","author":"Yokomori","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909600097X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909600097X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:52:42Z","timestamp":1555944762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909600097X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["002001909600097X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00097-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}