Skip to main content
SpringerLink
Log in
Book cover

International Conference on Graph Transformation

ICGT 2008: Graph Transformations pp 366–378Cite as

Pullback Grammars Are Context-Free

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5214))

Abstract

Following earlier work on pullback rewriting, we describe here the notion of graph grammar relevant to our formalism. We then show that pullback grammars are context-free and provide a surprising example, namely the context-free generation of square grids.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bauderon, M.: A uniform approach to graph rewriting: the pullback approach. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 101–115. Springer, Heidelberg (1995)

    Google Scholar 

  2. Bauderon, M., Jacquet, H.: Node rewriting in graphs and hypergraphs: a categorical framework. Theoretical Computer Science 266(1-2), 463–487 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bauderon, M., Jacquet, H., Klempien-Hinrichs, R.: Pullback rewriting and application. Electr. Notes Theor. Comput. Sci. 51, 83–92 (2001)

    Article  Google Scholar 

  4. Chen, R.: Graph Transformation and Graph Grammar Based on Pullback Operation, PhD thesis, Université Bordeaux 1 (2007)

    Google Scholar 

  5. Courcelle, B.: An axiomatic approach to context-free rewriting and its application to NLC graph grammars. Theoretical Computer Science 55, 141–181 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Engelfriet, J., Rozenberg, G.: Node Replacement Graph Grammars. In: [8], pp. 1–94.

    Google Scholar 

  7. Pierce, B.C.: Basic Category Theory for Computer Scientists. MIT Press, Cambridge (1991)

    Google Scholar 

  8. Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific Publishing, Singapore (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI - UMR 5800, Université de Bordeaux - CNRS, 351 cours de la Libération, Talence, 33405, France

    Michel Bauderon & Olivier Ly

  2. Zhongnan University of Economics and Law, 1 Nanhunan Road, Hongshan, Wuhan, 430073, China

    Rui Chen

Authors
  1. Michel Bauderon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rui Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Olivier Ly
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Hartmut Ehrig

  2. Department of Computer Science, University of Leicester, Leicester, UK

    Reiko Heckel

  3. Leiden Center for Natural Computing, Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  4. Department of Mathematics and Computer Science, Philipps-University Marburg, Marburg, Germany

    Gabriele Taentzer

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bauderon, M., Chen, R., Ly, O. (2008). Pullback Grammars Are Context-Free. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87405-8_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87404-1

  • Online ISBN: 978-3-540-87405-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation