{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:21:48Z","timestamp":1777105308162,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5433,"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":[[1998,9]]},"DOI":"10.1016\/s0304-3975(98)00039-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:04:53Z","timestamp":1027631093000},"page":"183-203","source":"Crossref","is-referenced-by-count":31,"title":["Sticker systems"],"prefix":"10.1016","volume":"204","author":[{"given":"Gheorghe","family":"P\u0103un","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00039-5_BIB1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","article-title":"Molecular computation of solutions to combinatorial problems","volume":"226","author":"Adleman","year":"1994","journal-title":"Science"},{"key":"10.1016\/S0304-3975(98)00039-5_BIB2","series-title":"1st Annual Pacific Symp. on Biocomputing","article-title":"DNA computing based on splicing: universality results","author":"Csuhaj-Varju","year":"1994"},{"key":"10.1016\/S0304-3975(98)00039-5_BIB3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/322123.322136","article-title":"A purely homomorphic characterization of recursively enumerable sets","volume":"26","author":"Culik","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00039-5_BIB4","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322203.322211","article-title":"Fixed point languages, equality languages, and representations of recursively enumerable languages","volume":"27","author":"Engelfriet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00039-5_BIB5","series-title":"The Mathematical Theory of Context-free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0304-3975(98)00039-5_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07675-0_7","article-title":"Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination","author":"Head","year":"1997"},{"key":"10.1016\/S0304-3975(98)00039-5_BIB7","doi-asserted-by":"crossref","unstructured":"L. Kari, Gh. P\u0103un, G. Rozenberg, A. Salomaa, S. Yu, DNA computing, sticker systems, and universality, Acta Inform. to appear.","DOI":"10.1007\/s002360050125"},{"issue":"1","key":"10.1016\/S0304-3975(98)00039-5_BIB8","first-page":"27","article-title":"Regular extended H systems are computationally universal","volume":"1","author":"P\u0103un","year":"1996","journal-title":"J. Automat. Lang. Combin."},{"issue":"2","key":"10.1016\/S0304-3975(98)00039-5_BIB9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0304-3975(96)00082-5","article-title":"Computing by splicing","volume":"168","author":"P\u0103un","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00039-5_BIB10","series-title":"Molecular computing. New computability paradigms","author":"P\u0103un","year":"1998"},{"issue":"3","key":"10.1016\/S0304-3975(98)00039-5_BIB11","first-page":"607","article-title":"DNA computing based on the splicing operation","volume":"43","author":"P\u0103un","year":"1996","journal-title":"Math. Japonica"},{"key":"10.1016\/S0304-3975(98)00039-5_BIB12","year":"1997"},{"key":"10.1016\/S0304-3975(98)00039-5_BIB13","first-page":"127","article-title":"Equality sets for homomorphisms of free monoids","volume":"4","author":"Salomaa","year":"1978","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(98)00039-5_BIB14","series-title":"Jewels of Formal Language Theory","author":"Salomaa","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:50:29Z","timestamp":1555375829000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0304397598000395"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00039-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}