The algorithmic beauty of plants
The algorithmic beauty of plants
Collages and patterns generated by hyperedge replacement
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
Handbook of formal languages, vol. 1
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
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Chain-Code Pictures and Collages Generated by Hyperedge Replacement
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Criteria to disprove context freeness of collage languages
Theoretical Computer Science
Hi-index | 0.00 |
In this paper, we introduce the notions of context-sensitive and ET0L collage grammars as generalizations of context-free collage grammars. Both kinds of picture-generating devices are more powerful than the context-free case. Nevertheless, the size of collages in an ET0L collage language can be shown to grow at most exponentially. In contrast to this, there are no such bounds for context-sensitive collage languages because suitable pictorial representations of recursively enumerable sets of strings can be generated. On the other hand, it is still a conjecture that ET0L collage languages exist that are not context-sensitive.