Skip to main content
SpringerLink
Log in

Context-free handle-rewriting hypergraph grammars

  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1990)

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

Abstract

Separated handle-rewriting hypergraph grammars (S-HH grammars) are introduced, where separated means that the nonterminal handles are disjoint. S-HH grammars have the same graph generating power as the vertex rewriting context-free NCE graph grammars, and as recursive systems of equations with four types of simple operations on graphs.

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. Systems Theory 20 (1987), 83–127

    Article  Google Scholar 

  2. F.J.Brandenburg; On polynomial time graph grammars, Proc. STACS 88, LNCS 294, 227–236

    Google Scholar 

  3. B. Courcelle; Equivalences and transformations of regular systems — applications to recursive program schemes and grammars, Theor. Comput. Sci. 42 (1986), 1–122

    Article  Google Scholar 

  4. B. Courcelle; An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theor. Comput. Sci. 55 (1987), 141–181

    Article  Google Scholar 

  5. B.Courcelle; The monadic second-order logic of graphs. III: Tree-width, forbidden minors and complexity issues, Report I-8852, Bordeaux

    Google Scholar 

  6. B. Courcelle; Some applications of logic, of universal algebra and of category theory to the theory of graph transformations, Bulletin of the EATCS 36 (1988), 161–218

    Google Scholar 

  7. B. Courcelle; The monadic second-order logic of graphs: Definable sets of finite graphs, LNCS 344 (1989), 30–53

    Google Scholar 

  8. B. Courcelle; The monadic second-order logic of graphs. I: Recognizable sets of finite graphs, Inform. Comput. 85 (1990), 12–75. See also [EhrNagRozRos], 112–133

    Article  Google Scholar 

  9. B.Courcelle, J.Engelfriet, G.Rozenberg; Handle-rewriting hypergraph grammars, parts I and II, Reports 90-08 and 90-09, Leiden, or Report 90-84, Bordeaux

    Google Scholar 

  10. H.Ehrig, M.Nagl, G.Rozenberg, A.Rosenfeld (eds.); Graph-Grammars and their Application to Computer Science, LNCS 291, 1987

    Google Scholar 

  11. H. Ehrig, G. Rozenberg: Some definitional suggestions for parallel graph grammars, in "Automata, Languages, and Development" (A. Lindenmayer, G. Rozenberg, eds.), North-Holland Pub. Co., Amsterdam, 1976, 443–468

    Google Scholar 

  12. J.Engelfriet; Context-free NCE graph grammars, Proc. FCT '89, LNCS 380, 148–161

    Google Scholar 

  13. J.Engelfriet; A characterization of context-free NCE graph languages by monadic second-order logic on trees, this Volume

    Google Scholar 

  14. J.Engelfriet, L.M.Heyker; The string generating power of context-free hypergraph grammars, Report 89-05, Leiden, to appear in JCSS

    Google Scholar 

  15. J.Engelfriet, L.M.Heyker; The term generating power of context-free hypergraph grammars, this Volume

    Google Scholar 

  16. J.Engelfriet, L.M.Heyker; Hypergraph languages of bounded degree, 1991, in preparation

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  19. J.Engelfriet, G.Leih, G.Rozenberg; Nonterminal separation in graph grammars, Report 88-29, Leiden, to appear in TCS

    Google Scholar 

  20. J. Engelfriet, G. Leih, E. Welzl; Boundary graph grammars with dynamic edge relabeling, JCSS 40 (1990), 307–345

    Google Scholar 

  21. J. Engelfriet, G. Rozenberg; A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. Comput. 84 (1990), 163–206

    Article  Google Scholar 

  22. A.Habel; Hyperedge replacement: grammars and languages, Ph.D.Thesis, Bremen, 1989

    Google Scholar 

  23. A.Habel, H.-J.Kreowski; Some structural aspects of hypergraph languages generated by hyperedge replacement, Proc. STACS '87, LNCS 247, 207–219

    Google Scholar 

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

    Google Scholar 

  25. D. Janssens, G. Rozenberg; On the structure of node-label-controlled graph languages, Inform. Sci. 20 (1980), 191–216

    Article  Google Scholar 

  26. D.Janssens, G.Rozenberg; A survey of NLC grammars, Proc. CAAP '83, LNCS 159, 114–128

    Google Scholar 

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

    Google Scholar 

  28. C. Lautemann; Efficient algorithms on context-free graph languages, Proc. ICALP '88, LNCS 317, 1988, 362–378

    Google Scholar 

  29. M.G. Main, G. Rozenberg; Handle NLC grammars and r.e. languages, JCSS 35 (1987), 192–205

    Google Scholar 

  30. M.G. Main, G. Rozenberg; Edge-label controlled graph grammars, JCSS 40 (1990), 188–228. See also [EhrNagRozRos], 411–426

    Google Scholar 

  31. J. Mezei, J.B. Wright; Algebraic automata and context-free sets, Inform. Contr. 11 (1967), 3–29

    Article  Google Scholar 

  32. U.Montanari, F.Rossi; An efficient algorithm for the solution of hierarchical networks of constraints, in [EhrNagRozRos], 440–457

    Google Scholar 

  33. M. Nagl, "Graph-grammatiken", Vieweg, Braunschweig, 1979

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université de Bordeaux 1, 351, Cours de la Libération, 33405, Talence, France

    Bruno Courcelle

  2. Department of Computer Science, Leiden University, P.O.Box 9512, 2300 RA, Leiden, The Netherlands

    Joost Engelfriet & Grzegorz Rozenberg

Authors
  1. Bruno Courcelle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Grzegorz Rozenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Courcelle, B., Engelfriet, J., Rozenberg, G. (1991). Context-free handle-rewriting hypergraph grammars. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017394

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54478-4

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation