Correct Translation of Mutually Recursive Function Systems into TOL Collage Grammars

Authors:
Renate Klempien-Hinrichs;Hans-Jörg Kreowski;Stefan Taubenberger
Affiliations:
-;-;-
Venue:
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Year:
1999

Citing 7
Cited 0

Fractals everywhere

Fractals everywhere
Affine automata and related techniques for generation of complex images

Theoretical Computer Science
Collages and patterns generated by hyperedge replacement

Languages of Design
L systems

Handbook of formal languages, vol. 1
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
Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, mutually recursive function systems, picture-generating devices known in the area of fractal geometry, are translated into TOL collage grammars. The translation works in such a way that the infinite sequence of pictures which is specified by a mutually recursive function system through the Hutchinson operator contains exactly those pictures which belong to the language generated by the corresponding TOL collage grammar. In other words, the translation is correct.