{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T23:34:38Z","timestamp":1782516878381,"version":"3.54.5"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":3850,"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,1]]},"DOI":"10.1016\/s0304-3975(01)00088-3","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T14:53:32Z","timestamp":1042815212000},"page":"611-638","source":"Crossref","is-referenced-by-count":15,"title":["Forbidding\u2013enforcing systems"],"prefix":"10.1016","volume":"292","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00088-3_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(01)00088-3_BIB2","series-title":"Understanding DNA and Gene Cloning","author":"Drlica","year":"1992"},{"key":"10.1016\/S0304-3975(01)00088-3_BIB3","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. Biol."},{"key":"10.1016\/S0304-3975(01)00088-3_BIB4","series-title":"Elements of the Theory of Computation","author":"Lewis","year":"1987"},{"key":"10.1016\/S0304-3975(01)00088-3_BIB5","unstructured":"New England BioLabs Catalog, 1998\/1999."},{"key":"10.1016\/S0304-3975(01)00088-3_BIB6","series-title":"DNA Computing: New Computing Paradigms","author":"Paun","year":"1998"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000883?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000883?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T06:51:08Z","timestamp":1554015068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397501000883"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00088-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}