Pretty patterns produced by hyperedge replacement
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
Fractals everywhere
Languages of Design
(Un-)decidability of geometric properties of pictures generated by collage grammars
Fundamenta Informaticae - Special issue on formal language theory
Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid
Journal of Computer and System Sciences
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Decidability of the finiteness of ranges of tree transductions
Information and Computation
Picture generation by collage grammars
Handbook of graph grammars and computing by graph transformation
Theoretical Computer Science
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Picture Languages: Formal Models for Picture Recognition
Picture Languages: Formal Models for Picture Recognition
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
May we introduce to you: hyperedge replacement
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
A property of random context picture grammars
Theoretical Computer Science
Computing raster images from grid picture grammars
Journal of Automata, Languages and Combinatorics
Branching synchronization grammars with nested tables
Journal of Computer and System Sciences
Grammatical Picture Generation: A Tree-Based Approach (Texts in Theoretical Computer Science. An EATCS Series)
Acta Informatica
| Hi-index | 0.00 |
We consider collage grammars whose rules subdivide the unit square into smaller and smaller rectangles. The decidability status of selected decision problems for this type of grammars is surveyed: the membership problem, the emptiness and finiteness problems, connectedness and disconnectedness of the generated pictures, and the question whether a generated collage contains a rectangle whose lower-left corner is a point on the diagonal.