Skip to main content
SpringerLink
Log in

Context-free NCE graph grammars

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bauderon, B. Courcelle; Graph expressions and graph rewritings, Math.Syst.Theory 20 (1987), 83–127.

    Article  Google Scholar 

  2. F.J.Brandenburg; On partially ordered graph grammars, in [EhrNagRozRos], 99–111.

    Google Scholar 

  3. F.J.Brandenburg; On polynomial time graph grammars, Proc. STACS 88, LNCS 294, Springer-Verlag, 1988, pp.227–236.

    Google Scholar 

  4. D.G. Corneil, H. Lerchs, L. Stewart Burlingham; Complement reducible graphs, Discr.Appl.Math. 3 (1981), 163–174.

    Article  Google Scholar 

  5. B. Courcelle; An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theor.Comp.Sci. 55 (1988), 141–182.

    Article  Google Scholar 

  6. B.Courcelle, J.Engelfriet, G.Rozenberg; Handle hypergraph grammars, in preparation.

    Google Scholar 

  7. H.Ehrig, M.Nagl, G.Rozenberg, A.Rosenfeld (eds.); Graph-grammars and their application to Computer Science, LNCS 291, Springer-Verlag, 1987.

    Google Scholar 

  8. J.Engelfriet, L.M.Heyker; The string generating power of context-free hypergraph grammars, Report 89-05, Leiden University, 1989.

    Google Scholar 

  9. J. Engelfriet, G. Leih; Linear graph grammars: power and complexity, Inform. Comput. 81 (1989), 88–121.

    Article  Google Scholar 

  10. J.Engelfriet, G.Leih; Complexity of boundary graph languages, Report 88-07, Leiden University, 1988, to appear in RAIRO.

    Google Scholar 

  11. J.Engelfriet, G.Leih, G.Rozenberg; Apex graph grammars, in [EhrNagRozRos], 167–185.

    Google Scholar 

  12. J.Engelfriet, G.Leih, G.Rozenberg; Nonterminal separation in graph grammars, Report 88-29, Leiden University, 1988.

    Google Scholar 

  13. J.Engelfriet, G.Leih, E.Welzl; Boundary graph grammars with dynamic edge relabeling, Report 87-30, Leiden University, 1987, to appear in JCSS.

    Google Scholar 

  14. J.Engelfriet, G.Rozenberg; A comparison of boundary graph grammars and context-free hypergraph grammars, Report 88-06, Leiden University, 1988, to appear in Inform. Comput.

    Google Scholar 

  15. J. Engelfriet, G. Rozenberg, G. Slutzki; Tree transducers, L systems, and two-way machines, J. Comput.System Sci. 20 (1980), 150–202.

    Article  Google Scholar 

  16. F. Gécseg, M. Steinby; "Tree automata", Akadémiai Kiadó, Budapest, 1984.

    Google Scholar 

  17. A.Habel, H.-J.Kreowski; May we introduce to you: hyperedge replacement, in [EhrNagRozRos], 15–26.

    Google Scholar 

  18. D.Janssens, H.-J.Kreowski, G.Rozenberg, H.Ehrig; Concurrency of node-label-controlled graph transformations, University of Antwerp, Report 82-38, 1982.

    Google Scholar 

  19. M.Kaul; Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken, Ph.D.Thesis, University of Osnabrück, 1985.

    Google Scholar 

  20. M. Nagl; "Graph-grammatiken", Vieweg, Braunschweig, 1979.

    Google Scholar 

  21. V.van Oostrom; Graph grammars and 2nd order logic (in Dutch), M.Sc.Thesis, 1989.

    Google Scholar 

  22. G.Rozenberg; An introduction to the NLC way of rewriting graphs, in [EhrNagRozRos], 55–66.

    Google Scholar 

  23. G. Rozenberg, E. Welzl; Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Inform. Contr. 69 (1986), 136–167.

    Article  Google Scholar 

  24. R.Schuster; Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität, Ph.D. Thesis, Report MIP-8711, University of Passau, 1987.

    Google Scholar 

  25. E.Welzl; Boundary NLC and partition controlled graph grammars, in [EhrNagRozRos], 593–609.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Leiden University, P.O.Box 9512, 2300 RA, Leiden, The Netherlands

    Joost Engelfriet

Authors
  1. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Engelfriet, J. (1989). Context-free NCE graph grammars. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation