{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:57:55Z","timestamp":1648933075320},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":7078,"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":[[1994,3]]},"DOI":"10.1016\/0304-3975(92)00079-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"259-293","source":"Crossref","is-referenced-by-count":1,"title":["Properties of grammatical codes of trees"],"prefix":"10.1016","volume":"125","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"ten Pas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)00079-7_BIB1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(91)90095-E","article-title":"Grammatical codes of trees","volume":"32","author":"Ehrenfeucht","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(92)00079-7_BIB2","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0304-3975(92)00079-7_BIB3","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)00079-7_BIB4","series-title":"The Art of Computer Programming, Vol. 1 : Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(92)00079-7_BIB5","series-title":"Formal Languages","author":"Salomaa","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592000797?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592000797?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:26:45Z","timestamp":1555115205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592000797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0304397592000797"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)00079-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}