Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid

Journal of Computer and System Sciences

Volumn 53, Issue 1, 1996, Pages 33-60

  Drewes, Frank ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FRACTALS; TREES (MATHEMATICS);

COLLAGE LANGUAGES; GRID TRANSFORMATIONS; TREE TRANSDUCERS;

ALGORITHMIC LANGUAGES;

EID: 0030217753     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0048     Document Type: Article

References (28)

1. T. M. Apostol, "Mathematical Analysis - A Modern Approach to Advanced Calculus," Addison-Wesley, Reading, MA, 1957.
2. B. S. Baker, Composition of top-down and bottom-up tree transductions, Inform. and Control 41 (1979), 186-213.
3. M. Barnsley, "Fractals Everywhere," Academic Press, Boston, 1988.
4. M. Bauderon and B. Courcelle, Graph expressions and graph rewriting, Math. Systems Theory 20 (1987), 83-127.
5. G. Birkhoff, "Lattice Theory," of Colloq. Publ., Vol. XXV, 2nd ed., Amer. Math. Soc., Providence, RI, 1948.
6. B. Courcelle, Graph rewriting: an algebraic and logic approach, in "Handbook of Theoretical Computer Science, Vol. B" (J. van Leuwen, Ed.), pp. 193-242, Elsevier, Amsterdam 1990.
7. B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform. and Comput. 85 (1990), 12-75.
8. K. Culik II and S. Dube, Affine automata and related techniques for generation of complex images, Theoret. Comput. Sci. 116 (1993), 373-398.
9. J. Dassow, A. Habel, and S. Taubenberger, Chain-code pictures and collages generated by hyperedge replacement, in "Proceedings, Fifth Intl. Workshop on Graph Grammars and Their Application to Comput. Sci." (H. Ehrig, H.-J. Kreowski, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Springer-Verlag, New York/ Berlin, 1996.
10. J. Dassow and F. Hinz, Decision problems and regular chain code picture languages, Discrete Appl. Math. 45 (1993), 29-49.
11. F. Drewes, "Computation by Tree Transductions," Doctoral dissertation, University of Bremen, Germany, 1996.
12. F. Drewes, A lower bound on the growth of functions computed by tree transductions, Fund. Inform. 26 (1996); short version in "CAAP 94," Lect. Notes in Comput. Sci., Vol. 787, Springer-Verlag, New York/ Berlin, 1995.
13. F. Drewes, A lower bound on the growth of functions computed by tree transductions, Fund. Inform. 26 (1996); short version in "CAAP 94," Lect. Notes in Comput. Sci., Vol. 787, Springer-Verlag, New York/ Berlin, 1995.
14. F. Drewes, A. Habel, H. Kreowski, and S. Taubenberger, Generating self-affine fractals by collage grammars, Theoret. Comput. Sci. 145 (1995), 159-187.
15. F. Drewes and H. Kreowski, (Un)decidability of properties of pictures generated by collage grammars, Fund. Inform., to appear.
16. S. Dube, Fractal geometry, Turing machines, and divide-and-conquer recurrences, RAIRO Theoret. Inform. Appl. 28 (1994), 405-423.
17. J. Engelfriet, Bottom-up and top-down tree transformations - A comparison, Math. Systems Theory 9, No. 3 (1975), 198-231.
18. J. Engelfriet, Graph grammars and tree transducers, in "Proceedings, CAAP 94" (S. Tison, Ed.), Lecture Notes in Computer Science, Vol. 787, pp. 15-37, Springer-Verlag, Berlin/New York, 1994.
19. K. Falconer, "Fractal Geometry: Mathematical Foundations and Applications," Wiley, Chichester, 1990.
20. F. Gécseg and M. Steinby, "Tree Automata," Akadémiai Kiadó, Budapest, 1984.
21. A. Habel and H. Kreowski, Collage grammars, in "Proceedings, Fourth Intl. Workshop on Graph Grammars and Their Application to Comput. Sci." (H. Ehrig, H.-J. Kreowski, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 532, pp. 411-429, Springer-Verlag, New York/Berlin, 1991.
22. A. Habel, H. Kreowski, and S. Taubenberger, Collages and patterns generated by hyperedge replacement, Languages Design 1 (1993), 125-145.
23. J. Mezei and J. B. Wright, Algebraic automata and context-free sets, Inform. and Control 11 (1967), 3-29.
24. H. Peitgen, H. Jürgens, and D. Saupe, "Chaos and Fractals. New Frontiers of Science," Springer-Verlag, New York, 1992.
25. W. C. Rounds, Mappings and grammars on trees, Math. Systems Theory 4 (1970), 257-287.
26. 2 sequential machine maps, J. Comput. System Sci. 4 (1970), 339-367.
27. J. W. Thatcher, There's a lot more to finite automata theory than you would have thought, in "Proceedings, 4th Annu. Princeton Conf. on Information Sciences and Systems, 1970," pp. 263-276; revised version published as [27].
28. J. W. Thatcher, Tree automata: An informal survey, in "Currents in the Theory of Computing" (A. V. Aho, Ed.), pp. 143-172, Prentice-Hall, Englewood Cliffs, NJ, 1973; revised version of [26].