Tree-based picture generation

Theoretical Computer Science

Volumn 246, Issue 1-2, 2000, Pages 1-51

  Drewes, Frank ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

Chain code grammar; Collage grammar; Iterated function system; Picture generation; Turtle interpretation

Indexed keywords

EID: 0004530721     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00168-7     Document Type: Article

References (35)

1. H. Abelson, A. diSessa, Turtle Geometry, MIT Press, Cambridge, MA, 1986.
2. M. Barnsley, Fractals Everywhere, Academic Press, Boston, 1988.
3. B. Courcelle, J. Engelfriet, A logical characterization of the sets of hypergraphs defined by hyperedge replacement grammars, Math. Systems Theory 28 (1995) 515-552.
4. K. Culik II, S. Dube, Affine automata and related techniques for generation of complex images, Theoret. Comput. Sci. 116 (1993) 373-398.
5. K. Culik II, S. Dube, L-systems and mutually recursive function systems, Acta Inform. 30 (1993) 279-302.
6. J. Dassow, A. Habel, S. Taubenberger, Chain-code pictures and collages generated by hyperedge replacement, in: J. Cuny, H Ehrig, G. Engels, G. Rozenberg (Eds.), Proc. 5th Internat. Workshop on Graph Grammars and Their Application to Comp. Science, Lecture Notes in Computer Science, vol. 1073, Springer, Berlin, 1996, pp. 412-421.
7. F. Drewes, Computation by tree transductions, Doctoral Dissertation, University of Bremen, Germany, 1996.
8. F. Drewes, Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid, J. Comput. System Sci. 53 (1996) 33-60.
9. F. Drewes, A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars, Theory Comput. Systems 32 (1998) 159-208.
10. F. Drewes, TREEBAG - a tree-based generator for objects of various types, Report 1/98, Univ. Bremen, 1998.
11. F. Drewes, J. Engelfriet, Decidability of the finiteness of ranges of tree transductions, Inform. and Comput. 145 (1998) 1-50.
12. F. Drewes, H.-J. Kreowski, Picture generation by collage grammars, in: H. Ehrig, G. Engels, H.-J. Kreowski, G. Rozenberg (Eds.), Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2, World Scientific, Singapore, 1999, pp. 397-457 (Chapter 11).
13. F. Drewes, H.-J. Kreowski, D. Lapoire, Criteria to disprove context-freeness of collage languages, in: B.S. Chlebus, L. Czaja (Eds.), Proc. Fundamentals of Computation Theory XI, Lecture Notes in Computer Science, vol. 1279, Springer, Berlin, 1997, pp. 169-178.
14. J. Engelfriet, Some open questions and recent results on tree transducers and tree languages, in: R.V. Book (Ed.), Formal Language Theory: Perspectives and Open Problems, Academic Press, New York, 1980, pp. 241-286.
15. J. Engelfriet, Graph grammars and tree transducers, in: S. Tison (Ed.), Proc. CAAP 94, Lecture Notes in Computer Science, vol. 787, Springer, Berlin, 1994, pp. 15-37.
16. J. Engelfriet, G. Rozenberg, G. Slutzki, Tree transducers, L systems, and two-way machines, J. Comput. System Sci. 20 (1980) 150-202.
17. J. Engelfriet, E.M. Schmidt, IO and OI. I, J. Comput. System Sci. 15 (1977) 328-353.
18. J. Engelfriet, E.M. Schmidt, IO and OI. II, J. Comput. System Sci. 16 (1978) 67-99.
19. F. Gécseg, M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest, 1984.
20. F. Gécseg, M. Steinby, Tree languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages. Vol. III: Beyond Words, Springer, Berlin, 1997, pp. 1-68 (Chapter 1).
21. B. Grünbaum, G.C. Shephard, Tilings and Patterns, Freeman, New York, 1987.
22. A. Habel, H.-J. Kreowski, Collage grammars, in: H. Ehrig, H.-J. Kreowski, G. Rozenberg (Eds.), Proc. 4th Internat. Workshop on Graph Grammars and Their Application to Comp. Sci., Lecture Notes in Computer Science, vol. 532, Springer, Berlin, 1991, pp. 411-429.
23. L. Kari, G. Rozenberg, A. Salomaa, L systems, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages. Vol. I: Word, Language, Grammar, Springer, Berlin, 1997, pp. 253-328 (Chapter 5).
24. B.B. Mandelbrot, The Fractal Geometry of Nature, W.H. Freeman and Company, New York, 1983.
25. H.A. Maurer, G. Rozenberg, E. Welzl, Using string languages to describe picture languages, Inform. and Control 54 (1982) 155-185.
26. J. Mezei, J.B. Wright, Algebraic automata and context-free sets, Inform, and Control 11 (1967) 3-29.
27. H.-O. Peitgen, H. Jürgens, D. Saupe, Chaos and Fractals. New Frontiers of Science, Springer, New York, 1992.
28. P. Prusinkiewicz, A. Lindenmayer, The Algorithmic Beauty of Plants, Springer, New York, 1990.
29. A. Rosenfeld, Picture Languages: Formal Models for Picture Recognition, Academic Press, New York, 1979.
30. A. Rosenfeld, R. Siromoney, Picture languages - a survey, Languages Des. 1 (1993) 229-245.
31. W.C. Rounds, Context-free grammars on trees, Proc. 1st Annual ACM Symp. on Theory of Computing (STOC) 1969, pp. 143-148.
32. W.C. Rounds, Mappings and grammars on trees, Math. Systems Theory 4 (1970) 257-287.
33. W.C. Rounds, Tree-oriented proofs of some theorems on context-free and indexed languages, Proc. 2nd Annual ACM Symp. on Theory of Computing (STOC) (1970) 109-116.
34. G. Rozenberg, Extensions of tabled OL systems and languages, Internat. J. Comput. Inform. Sci. 2 (1973) 311-334.
35. 2 sequential machine maps, J. Comput. System Sci. 4 (1970) 339-367.