Advertisement

Correct translation of mutually recursive function systems into TOL collage grammars

  • Renate Klempien-Hinrichs
  • Hans-Jörg Kreowski
  • Stefan Taubenberger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1684)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bar88]
    Michael Barnsley. Fractals Everywhere. Academic Press, Boston, 1988.zbMATHGoogle Scholar
  2. [CD93a]
    Karel Culik II and Simant Dube. Affine automata and related techniques for generation of complex images. Theoretical Computer Science, 116:373–398, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [CD93b]
    Karel Culik II and Simant Dube. L-systems and mutually recursive function systems. Acta Informatica, 30:279–302, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [Cox89]
    H.S.M. Coxeter. Introduction to Geometry. John Wiley & Sons, New York, Wiley Classics Library, second edition, 1989.Google Scholar
  5. [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
  6. [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
  7. [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
  8. [Hab92]
    Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer, 1992.zbMATHGoogle Scholar
  9. [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
  10. [Hut81]
    John E. Hutchinson. Fractals and self similarity. Indiana University Mathematics Journal, 30:713–747, 1981.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [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
  12. [PJS92]
    Heinz-Otto Peitgen, Hartmut Jürgens, and Dietmar Saupe. Chaos and Fractals. New Frontiers of Science. Springer, New York, 1992.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Renate Klempien-Hinrichs
    • 1
  • Hans-Jörg Kreowski
    • 1
  • Stefan Taubenberger
    • 1
  1. 1.Department of Computer ScienceUniversity of BremenBremenGermany

Personalised recommendations