{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:25Z","timestamp":1761611065027},"reference-count":35,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":4702,"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":[[2000,9]]},"DOI":"10.1016\/s0304-3975(00)00168-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:13:43Z","timestamp":1027592023000},"page":"1-51","source":"Crossref","is-referenced-by-count":16,"title":["Tree-based picture generation"],"prefix":"10.1016","volume":"246","author":[{"given":"Frank","family":"Drewes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00168-7_BIB1","series-title":"Turtle Geometry","author":"Abelson","year":"1986"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB2","series-title":"Fractals Everywhere","author":"Barnsley","year":"1988"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB3","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01204169","article-title":"A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars","volume":"28","author":"Courcelle","year":"1995","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB4","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0304-3975(93)90329-R","article-title":"Affine automata and related techniques for generation of complex images","volume":"116","author":"Culik II","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01179375","article-title":"L-systems and mutually recursive function systems","volume":"30","author":"Culik II","year":"1993","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB6","series-title":"Proc. 5th Internat. Workshop on Graph Grammars and Their Application to Comp. Science","first-page":"412","article-title":"Chain-code pictures and collages generated by hyperedge replacement","volume":"vol. 1073","author":"Dassow","year":"1996"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB7","unstructured":"F. Drewes, Computation by tree transductions, Doctoral Dissertation, University of Bremen, Germany, 1996."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB8","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1006\/jcss.1996.0048","article-title":"Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid","volume":"53","author":"Drewes","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s002240000115","article-title":"A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars","volume":"32","author":"Drewes","year":"1998","journal-title":"Theory Comput. Systems"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB10","unstructured":"F. Drewes, Treebag \u2013 a tree-based generator for objects of various types, Report 1\/98, Univ. Bremen, 1998."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1998.2715","article-title":"Decidability of the finiteness of ranges of tree transductions","volume":"145","author":"Drewes","year":"1998","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB12","first-page":"397","article-title":"Picture generation by collage grammars","volume":"vol. 2","author":"Drewes","year":"1999"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB13","series-title":"Proc. Fundamentals of Computation Theory XI","first-page":"169","article-title":"Criteria to disprove context-freeness of collage languages","volume":"vol. 1279","author":"Drewes","year":"1997"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB14","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"241","article-title":"Some open questions and recent results on tree transducers and tree languages","author":"Engelfriet","year":"1980"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB15","series-title":"Proc. CAAP 94","first-page":"15","article-title":"Graph grammars and tree transducers","volume":"vol. 787","author":"Engelfriet","year":"1994"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB16","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","article-title":"Tree transducers, L systems, and two-way machines","volume":"20","author":"Engelfriet","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB17","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","article-title":"IO and OI. I","volume":"15","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0022-0000(78)90051-X","article-title":"IO and OI. II","volume":"16","author":"Engelfriet","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB19","series-title":"Tree Automata","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB20","series-title":"Handbook of Formal Languages. Vol. III: Beyond Words","first-page":"1","article-title":"Tree languages","author":"G\u00e9cseg","year":"1997"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB21","series-title":"Tilings and Patterns","author":"Gr\u00fcnbaum","year":"1987"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB22","first-page":"411","article-title":"Collage grammars","volume":"vol. 532","author":"Habel","year":"1991"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB23","series-title":"Handbook of Formal Languages. Vol. I: Word, Language, Grammar","first-page":"253","article-title":"L systems","author":"Kari","year":"1997"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB24","series-title":"The Fractal Geometry of Nature","author":"Mandelbrot","year":"1983"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB25","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0019-9958(82)80020-X","article-title":"Using string languages to describe picture languages","volume":"54","author":"Maurer","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","article-title":"Algebraic automata and context-free sets","volume":"11","author":"Mezei","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB27","series-title":"Chaos and Fractals. New Frontiers of Science","author":"Peitgen","year":"1992"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB28","series-title":"The Algorithmic Beauty of Plants","author":"Prusinkiewicz","year":"1990"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB29","series-title":"Picture Languages: Formal Models for Picture Recognition","author":"Rosenfeld","year":"1979"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB30","first-page":"229","article-title":"Picture languages \u2013 a survey","volume":"1","author":"Rosenfeld","year":"1993","journal-title":"Languages Des."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB31","doi-asserted-by":"crossref","unstructured":"W.C. Rounds, Context-free grammars on trees Proc. 1st Annual ACM Symp. on Theory of Computing (STOC) 1969, pp. 143\u2013148.","DOI":"10.1145\/800169.805428"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB32","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\/S0304-3975(00)00168-7_BIB33","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/800161.805156","article-title":"Tree-oriented proofs of some theorems on context-free and indexed languages","author":"Rounds","year":"1970","journal-title":"Proc. 2nd Annual ACM Symp. on Theory of Computing (STOC)"},{"key":"10.1016\/S0304-3975(00)00168-7_BIB34","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00985664","article-title":"Extensions of tabled 0L systems and languages","volume":"2","author":"Rozenberg","year":"1973","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/S0304-3975(00)00168-7_BIB35","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001687?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001687?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:19:30Z","timestamp":1578521970000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001687"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0304397500001687"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00168-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}