{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:51:22Z","timestamp":1754556682942},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,6,1]],"date-time":"1976-06-01T00:00:00Z","timestamp":202435200000},"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":13560,"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":[[1976,6]]},"DOI":"10.1016\/0304-3975(76)90003-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"9-27","source":"Crossref","is-referenced-by-count":18,"title":["Surface tree languages and parallel derivation trees"],"prefix":"10.1016","volume":"2","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90003-7_BIB1","series-title":"Ph.D. Thesis","article-title":"Tree transductions and families of tree languages","author":"Baker","year":"1973"},{"key":"10.1016\/0304-3975(76)90003-7_BIB2","series-title":"Ph.D. Thesis","article-title":"Formal languages and recursion schemes","author":"Downey","year":"1974"},{"key":"10.1016\/0304-3975(76)90003-7_BIB3","series-title":"Memorandum nr. 19","article-title":"Bottom-up and top-down tree transformations\u2014a comparison","author":"Engelfriet","year":"1971"},{"key":"10.1016\/0304-3975(76)90003-7_BIB4","series-title":"Developmental Systems and Languages","author":"Herman","year":"1975"},{"key":"10.1016\/0304-3975(76)90003-7_BIB5","series-title":"Daimi Report PB-37","article-title":"EOL and ETOL systems with control devices","author":"Nielsen","year":"1974"},{"issue":"1","key":"10.1016\/0304-3975(76)90003-7_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/BF00288938","article-title":"Nonterminals, homomorphisms and codings in various 0L systems","volume":"4","author":"Nielsen","year":"1974","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(76)90003-7_BIB7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","article-title":"Mappings and grammars on trees","volume":"4","author":"Rounds","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(76)90003-7_BIB8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00985664","article-title":"Extension of tabled 0L-systems and languages","volume":"2","author":"Rozenberg","year":"1973","journal-title":"Internat. J. Comput. Information Sci."},{"key":"10.1016\/0304-3975(76)90003-7_BIB9","article-title":"L Systems","volume":"15","year":"1974"},{"key":"10.1016\/0304-3975(76)90003-7_BIB10","series-title":"Automata, Languages and Programming","first-page":"523","article-title":"Parallelism in rewriting systems","volume":"14","author":"Salomaa","year":"1974"},{"issue":"1","key":"10.1016\/0304-3975(76)90003-7_BIB11","doi-asserted-by":"crossref","DOI":"10.1016\/S0019-9958(74)90732-3","article-title":"On extensions of Algol-like languages","volume":"26","author":"Skyum","year":"1974","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90003-7_BIB12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","article-title":"Characterizing derivation trees of context-free grammars through a generalization of finite automata theory","volume":"1","author":"Thatcher","year":"1967","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90003-7_BIB13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","article-title":"Generalized2 sequential machine maps","volume":"4","author":"Thatcher","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(76)90003-7_BIB14","series-title":"Currents in the Theory of Computing","first-page":"143","article-title":"Tree automata: an informal survey","author":"Thatcher","year":"1973"},{"key":"10.1016\/0304-3975(76)90003-7_BIB15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision problem of second-order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900037?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900037?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:21:02Z","timestamp":1555125662000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,6]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,6]]}},"alternative-id":["0304397576900037"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90003-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,6]]}}}