(Un-)decidability of geometric properties of pictures generated by collage grammars

Fundamenta Informaticae

Volumn 25, Issue 3-4, 1996, Pages 295-325

  Drewes, F ^a   Kreowski, H J ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26444616264     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-253407     Document Type: Article

References (14)

1. M. Barnsley. Fractals Everywhere. Academic Press, Boston, 1988.
2. K. Culik II, S. Dube. Affine automata and related techniques for generation of complex images. Theoretical Computer Science 116, 373-398, 1993.
3. B. Courcelle. Graph rewriting: an algebraic and logic approach. In J. van Leuwen, editor, Handbook of Theoretical Computer Science, volume B, 193-242. Elsevier, Amsterdam, 1990.
4. H.S.M. Coxeter. Introduction to Geometry. John Wiley & Sons, New York, Wiley Classics Library, second edition, 1989.
5. J. Dassow, F. Hinz. Decision problems and regular chain code picture languages. Discrete Applied Mathematics 45, 29-49, 1993.
6. F. Drewes, A. Habel, H.-J. Kreowski, S. Taubenberger. Generating self-affine fractals by collage grammars. In G. Rozenberg, A. Salomaa, editors, Proc. Developments in Language Theory. World Scientific Publishing Co., 1994.
7. Long version to appear in Theoretical Computer Science.
8. A. Habel, H.-J. Kreowski. Collages and patterns generated by hyperedge replacement. Report 15/90, Univ. Bremen, 1990.
9. A. Habel, H.-J. Kreowski. Collage grammars. In H. Ehrig, H.-J. Kreowski, G. Rozenberg, editors, Proc. Fourth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci., Lecture Notes in Computer Science 532, 411-429, 1991.
10. A. Habel, H.-J. Kreowski, C. Lautemann. A comparison of compatible, finite, and inductive graph properties. Theoretical Computer Science 110, 145-168, 1993.
11. A. Habel, H.-J. Kreowski, S. Taubenberger. Collages and patterns generated by hyperedge replacement. Languages of Design 1, 125-145, 1993.
12. A. Habel, H.-J. Kreowski, W. Vogler. Metatheorems for decision problems on hyperedge replacement graph languages. Acta Informatica 26, 657-677, 1989.
13. J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Massachusetts, 1979.
14. T. Lengauer, E. Wanke. Efficient analysis of graph properties on context-free graph languages. Lecture Notes in Computer Science 317, 379-393, 1988.