Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1997: Fundamentals of Computation Theory pp 169–178Cite as

Criteria to disprove context-freeness of collage languages

  • Technical Contributions
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1279))

Abstract

Collage grammars generate picture languages in a context-free way. The generating process is based on the replacement of atomic nonterminal items and can be seen as an adaptation of the notion of hyperedge replacement known from the area of context-free graph generation. While a pumping lemma holds for hyperedge replacement graph grammars and is quite useful to show that certain graph languages cannot be generated, the same technique fails in the collage case, unfortunately. But, in this paper, we present some other criteria that allow to disprove context freeness of collage languages.

Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) through the University of Bremen. The paper was written while the third author visited Bremen.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Michael Barnsley. Fractals Everywhere. Academic Press, Boston, 1988.

    Google Scholar 

  2. H.S.M. Coxeter. Introduction to Geometry. John Wiley & Sons, New York, Wiley Classics Library, second edition, 1989.

    Google Scholar 

  3. 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 Transformations. Vol. I: Foundations, chapter 2, pages 95–162. World Scientific, 1997.

    Google Scholar 

  4. Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, and Stefan Taubenberger. Generating self-affine fractals by collage grammars. Theoretical Computer Science, 145:159–187, 1995.

    Article  Google Scholar 

  5. Frank Drewes and Hans-Jörg Kreowski. (Un-)decidability of geometric properties of pictures generated by collage grammars. Fundamenta Informaticae, 25:295–325, 1996.

    Google Scholar 

  6. Frank Drewes. Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid. Journal of Computer and System Sciences, 53:33–60, 1996.

    Article  Google Scholar 

  7. Kenneth Falconer. Fractal Geometry: Mathematical Foundations and Applications. John Wiley & Sons, Chichester, 1990.

    Google Scholar 

  8. Ferenc Gécseg and Magnus Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.

    Google Scholar 

  9. Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer-Verlag, 1992.

    Google Scholar 

  10. 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 

  11. Benoit B. Mandelbrot. The Fractal Geometry of Nature. W.H. Freeman and Company, New York, 1983.

    Google Scholar 

  12. Heinz-Otto Peitgen, Hartmut Jürgeus, and Dietmar Saupe. Chaos and Fractals. New Frontiers of Science. Springer-Verlag, New York, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bremen, P.O. Box 330440, D-28334, Bremen, Germany

    Frank Drewes, Hans-Jörg Kreowski & Denis Lapoire

  2. LaBRI, Université Bordeaux I, 351, cours de la liberation, 33400, Talence Cedex, France

    Denis Lapoire

Authors
  1. Frank Drewes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Denis Lapoire
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drewes, F., Kreowski, HJ., Lapoire, D. (1997). Criteria to disprove context-freeness of collage languages. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036181

Download citation

  • DOI: https://doi.org/10.1007/BFb0036181

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation