Skip to main content

Fundamentals of edge-label controlled graph grammars

  • Part II Technical Contributions
  • Conference paper
  • First Online:
Graph-Grammars and Their Application to Computer Science (Graph Grammars 1986)

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

  • 247 Accesses

Abstract

We introduce a graph-grammar model based on edge-replacement, where both the rewriting and the embedding mechanisms are controlled by edge labels. The general power of this model is established — it turns out to have the complete power of recursive enumerability (in a sense to be made precise in the paper). In order to understand where this power originates, we identify three basic features of the embedding mechanism and examine how restrictions on these features affect the generative power. In particular, by imposing restrictions on all three features simultaneously, we obtain a graph-grammar model that was previously introduced by Kreowski and Habel.

G. Rozenberg has been supported in part by National Science Foundation Grant MCS-83-05245. M. Main has been supported in part by National Science Foundation Grant DCR-84-02341.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. H. Ehrig, M. Pfender and H.J. Schneider. Graph grammars — an algebraic approach, in: Proc. Conf. Switch. Automata Theory (1973), 167–180.

    Google Scholar 

  2. A. Habel and H.-J. Kreowski. On context-free graph languages generated by edge replacement, in: Graph-Grammars and Their Application to Computer Science, 2nd International Workshop, (H. Ehrig, M. Nagl and G. Rozenberg, eds), LNCS 153, Springer-Verlag, Berlin (1983), 143–158.

    Google Scholar 

  3. A. Habel and H.-J. Kreowski. Characteristics of graph langages generated by edge replacement, Technical Report, Department of Computer Science, University of Bremen (1985).

    Google Scholar 

  4. J. Hoffmann and M.G. Main. Results on NLC grammars with one-letter terminal alphabets, University of Colorado Technical Report Cu-CS-348-86 (September 1986).

    Google Scholar 

  5. D. Janssens and G. Rozenberg. On the structure of node-label controlled graph languages, Information Sciences 20 (1980), 191–216.

    Article  Google Scholar 

  6. D. Janssens and G. Rozenberg. Restrictions, extensions and variations of NLC grammars, Information Sciences 20 (1980), 217–244.

    Article  Google Scholar 

  7. D. Janssens and G. Rozenberg. Decision problems for node-label controlled graph grammars, JCSS 22 (1981), 144–177.

    Google Scholar 

  8. D. Janssens and G. Rozenberg. Graph grammars with neighbourhood controlled embedding, TCS 21 (1982), 55–74.

    Article  Google Scholar 

  9. M.G. Main and G. Rozenberg. Handle NLC grammars and languages, University of Colorado Technical Report CU-CS-315-85 (1985), Journal of Computer and System Sciences, to appear.

    Google Scholar 

  10. M.G. Main and G. Rozenberg. Edge-Label controlled graph grammars, University of Colorado Technical Report CU-CS-349-86 (1986), Paper presented at the 1986 Workshop on Graph Grammars and their Applications (University of Maryland).

    Google Scholar 

  11. M. Nagl. A tutorial and bibliographical survey on graph grammars, in: Graph-Grammars and Their Application to Computer Science and Biology (V. Claus, H. Ehrig and G. Rozenberg, eds), LNCS 73, Springer-Verlag, Berlin (1978), 70–126.

    Google Scholar 

  12. G. Rozenberg and E. Welzl. Boundary NLC graph grammars — basic definitions, normal forms and complexity, Information and Control 69 (1986), 136–167.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hartmut Ehrig Manfred Nagl Grzegorz Rozenberg Azriel Rosenfeld

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Main, M.G., Rozenberg, G. (1987). Fundamentals of edge-label controlled graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1986. Lecture Notes in Computer Science, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18771-5_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-18771-5_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48178-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics