{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:52:56Z","timestamp":1648932776125},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"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":9055,"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":[[1988,10]]},"DOI":"10.1016\/0304-3975(88)90108-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"67-81","source":"Crossref","is-referenced-by-count":2,"title":["Comparison of two graph-rewrite systems"],"prefix":"10.1016","volume":"61","author":[{"given":"P.M.","family":"Van Den Broek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90108-9_BIB1","series-title":"Graph Grammars and their Applications to Computer Science and Biology","first-page":"1","article-title":"Introduction to the algebraic theory of graph grammars (a survey)","volume":"73","author":"Ehrig","year":"1979"},{"key":"10.1016\/0304-3975(88)90108-9_BIB2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/SWAT.1973.11","article-title":"Graph grammars: an algebraic approach","author":"Ehrig","year":"1973","journal-title":"Proc. 14th Ann. Conf. on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(88)90108-9_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(84)90021-5","article-title":"On graph rewritings","volume":"32","author":"Raoult","year":"1984","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:28Z","timestamp":1555127668000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["0304397588901089"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90108-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,10]]}}}