{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:50:24Z","timestamp":1649044224300},"reference-count":4,"publisher":"Springer Science and Business Media LLC","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":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1007\/bf01195201","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T06:16:45Z","timestamp":1108707405000},"page":"159-181","source":"Crossref","is-referenced-by-count":1,"title":["Semantics of trees"],"prefix":"10.1007","volume":"27","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0019-9958(80)90749-4","volume":"47","author":"A. Ehrenfeucht","year":"1980","unstructured":"A. Ehrenfeucht and G. Rozenberg, On basic properties of DOS systems and languages,Inform. and Control,47 (1980), 137?153.","journal-title":"Inform. and Control"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(91)90095-E","volume":"32","author":"A. Ehrenfeucht","year":"1991","unstructured":"A. Ehrenfeucht and G. Rozenberg, Grammatical codes of trees,Discrete Appl. Math.,32 (1991), 103?129.","journal-title":"Discrete Appl. Math."},{"key":"CR3","unstructured":"A. Ehrenfeucht, P. ten Pas, and G. Rozenberg, Properties of grammatical codes of trees, Tech. Report No. RUL-91-07, Department of Computer Science, University of Leiden, 1991. To appear inTheoretical Computer Science."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(81)90097-9","volume":"16","author":"H. C. M. Kleijn","year":"1981","unstructured":"H. C. M. Kleijn and G. Rozenberg, Context-free like restrictions on selective rewriting,Theoret. Comput. Sci.,16 (1981), 237?269.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01195201.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01195201\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01195201","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T09:09:47Z","timestamp":1556615387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01195201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01195201"],"URL":"https:\/\/doi.org\/10.1007\/bf01195201","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}