(UN-)DECIDABILITY OF GEOMETRIC PROPERTIES OF PICTURES GENERATED BY COLLAGE GRAMMARS

Authors:
F. Drewes;H.-J. Kreowski
Affiliations:
Universität Bremen, Fachbereich 3, D-28334 Bremen (Germany) E-mail: {drewes,kreo}@informatik.uni-bremen.de;Universität Bremen, Fachbereich 3, D-28334 Bremen (Germany) E-mail: {drewes,kreo}@informatik.uni-bremen.de
Venue:
Fundamenta Informaticae
Year:
1996

Citing 11
Cited 0

Fractals everywhere

Fractals everywhere
Metatheorems for decision problems on hyperedge replacement graph languages

Acta Informatica
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
A comparison of compatible, finite, and inductive graph properties

Theoretical Computer Science
Affine automata and related techniques for generation of complex images

Theoretical Computer Science
Decision problems and regular chain code picture languages

Discrete Applied Mathematics
Collages and patterns generated by hyperedge replacement

Languages of Design
Generating self-affine fractals by collage grammars

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract)

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Collage Grammars

Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Collage grammars are based on hyperedge replacement in a geometric environment and provide context-free syntactic devices for the generation of picture languages. An intriguing question is which geometric properties of the generated pictures can be decided by inspecting the generating collage grammars. The results presented in this paper address the question in two respects. (1) The decidability results known for hyperedge replacement grammars generating graph languages, based on the notion of compatibility, can be carried over to collage grammars. Unfortunately, compatible properties seem rare in the geometric setting. In this paper three concrete ones are presented. (2) In some other cases being only a minor extensions of situations for which compatibility is obtained, we can prove undecidability results.