Fractals everywhere
Generating self-affine fractals by collage grammars
Theoretical Computer Science
Handbook of formal languages, vol. 3
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Picture generation by collage grammars
Handbook of graph grammars and computing by graph transformation
Theoretical Computer Science
Tree-based generation of languages of fractals
Theoretical Computer Science
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Criteria to Disprove Context-Freeness of Collage Languages
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Table-driven and context-sensitive collage languages
Journal of Automata, Languages and Combinatorics
Hi-index | 5.23 |
Collage grammars are context-free devices which generate picture languages consisting of collages--sets of parts, where a part is a set of points in a given space. In order to show that certain collage languages cannot be generated, the well-known pumping technique turns out to be rather useless. To circumvent this difficulty, other necessary criteria for context-freeness are established in this paper. Roughly speaking, these criteria reveal that (1) the collages in a context-free collage language can be deflated stepwise in such a manner that the difference between subsequent collages in the resulting chain is small and (2) the volume of parts can grow or shrink only exponentially.