{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:24:31Z","timestamp":1648851871685},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":6347,"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":[[1996,3]]},"DOI":"10.1016\/0304-3975(95)00093-3","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"425-438","source":"Crossref","is-referenced-by-count":0,"title":["A note on binary grammatical codes of trees"],"prefix":"10.1016","volume":"155","author":[{"given":"Andrzej","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulien","family":"ten Pas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00093-3_BIB1","unstructured":"A. Ehrenfeucht, J. Engelfriet, P. ten Pas and G. Rozenberg, Grammatical codes of trees and terminally coded grammars, Fund. Inform., to appear."},{"key":"10.1016\/0304-3975(95)00093-3_BIB2","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(95)00093-3_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-3975(92)00079-7","article-title":"Properties of grammatical codes of trees","volume":"125","author":"Ehrenfeucht","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00093-3_BIB4","article-title":"The Art of Computer Programming","volume":"Vol 1","author":"Knuth","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000933?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000933?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:52:36Z","timestamp":1555404756000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0304397595000933"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00093-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}