Advertisement

HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting

  • Changwook Kim
  • Tae Eui Jeong
Graph Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1073)

Abstract

We introduce a hypergraph-generating system, called HRNCE grammars, which is structurally simple and descriptively powerful, and present their basic properties, in particular their description power and normal forms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    IJ. J. Aalbersberg, J. Engelfriet and G. Rozenberg, The complexity of regular DNLC graph languages, J. Comput. System Sci. 40 (1990), 376–404.Google Scholar
  2. [2]
    M. Bauderon and B. Courcelle, Graph expressions and graph rewritings, Math. Systems Theory 20 (1987), 83–127.Google Scholar
  3. [3]
    B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55 (1987), 141–181.Google Scholar
  4. [4]
    B. Courcelle, J. Engelfriet and G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci. 46 (1993), 218–270.Google Scholar
  5. [5]
    J. Engelfriet and L. Heyker, Hypergraph languages of bounded degree, J. Comput. System Sci. 48 (1994), 58–89.Google Scholar
  6. [6]
    J. Engelfriet and G. Leih, Linear graph grammars: power and complexity, Inform. and Comput. 81 (1989), 88–121.Google Scholar
  7. [7]
    J. Engelfriet and G. Leih, Complexity of boundary graph languages, Theoretical Informatics and Applications 24 (1990), 267–274.Google Scholar
  8. [8]
    J. Engelfriet, G. Leih and E. Welzl, Boundary graph grammars with dynamic edge relabeling, J. Comput. System Sci. 40 (1990), 307–345.Google Scholar
  9. [9]
    J. Engelfriet and G. Rozenberg, A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. and Comput. 84 (1990), 163–206.Google Scholar
  10. [10]
    A. Habel and H.-J. Kreowski, Some structural aspects of hypergraph languages generated by hyperedge replacement, Proc. STACS 87, Lecture Notes in Computer Science 247 (1987), 207–219.Google Scholar
  11. [11]
    D. Janssens and G. Rozenberg, On the structure of node-label-controlled graph languages, Inform. Sci. 20 (1980), 191–216.Google Scholar
  12. [12]
    D. Janssens and G. Rozenberg, Restrictions, extensions, and variations of NLC grammars, Inform. Sci. 20 (1980), 217–244.Google Scholar
  13. [13]
    C. Lautemann, The complexity of graph languages generated by hyperedge replacement, Acta Inform. 27 (1990), 399–421.Google Scholar
  14. [14]
    G. Rozenberg and E. Welzl, Boundary NLC graph grammars — Basic definitions, normal forms, and complexity, Inform. and Control 69 (1986), 136–167.Google Scholar
  15. [15]
    Gy. Turán, On the complexity of graph grammars, Acta Cybernet. 6 (1983), 271–280.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Changwook Kim
    • 1
  • Tae Eui Jeong
    • 1
  1. 1.School of Computer ScienceUniversity of OklahomaNormanUSA

Personalised recommendations