Correct translation of mutually recursive function systems into TOL collage grammars
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.
Unable to display preview. Download preview PDF.
- [Cox89]H.S.M. Coxeter. Introduction to Geometry. John Wiley & Sons, New York, Wiley Classics Library, second edition, 1989.Google Scholar
- [DHK97]Frank Drewes, Annegret Habel, and Hans-Jörg Kreowski. Hyperedge replacement graph grammars. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 1: Foundations, chapter 2, pages 95–162. World Scientific, 1997.Google Scholar
- [DK99]Frank Drewes and Hans-Jörg Kreowski. Picture generation by collage grammars. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2. World Scientific, 1999. To appear.Google Scholar
- [DKK99]Frank Drewes, Renate Klempien-Hinrichs, and Hans-Jörg Kreowski. Table-driven and context-sensitive collage languages. In Proc. Developments in Language Theory’ 99, 1999. To appear.Google Scholar
- [HKT93]Annegret Habel, Hans-Jörg Kreowski, and Stefan Taubenberger. Collages and patterns generated by hyperedge replacement. Languages of Design, 1:125–145, 1993.Google Scholar
- [KRS97]Lila Kari, Grzegorz Rozenberg, and Arto Salomaa. L systems. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. I: Word, Language, Grammar, chapter 5, pages 253–328. Springer, 1997.Google Scholar