Skip to main content
SpringerLink
Log in

On labelled graph grammars

Über die Markierten Graph-Grammatiken

  • Published:
Computing Aims and scope Submit manuscript

abstract

According to the classification of labelled graph grammars by Nagl [4], it can be shown that the class of context-sensitive graph languages is equivalent to the class of context-free graph languages and the context-free graph languages properly include the regular graph languages.

Zusammenfassung

Mit der Klassifikation der Markierten Graph-Grammatiken von Nagl [4] kann man zeigen, daß die Klasse der Kontext-sensitiven Graph-Sprachen gleich ist wie die Klasse von Kontext-freien Graph-Sprachen, und daß die Kontext-freien Graph-Sprachen eigentlich die regulären Graph-Sprachen enthalten.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abe, N., Mizumoto, M., Toyoda, J. I., Tanaka, K.: Web Grammars and Several Graphs. J. Comp. Syst. Sci.7, 37–65 (1973).

    Google Scholar 

  2. Ehrig, H., Pfender, M., Schneider, H. J.: Graph Grammars — an Algebraic Approach. Proc. Conf. Switch. Automata. Theory1973, 167–180.

  3. Montanari, U. G.: Separable Graphs, Planar Graphs and Web Grammars. Inf. Contr.16, 243 to 267 (1970).

    Google Scholar 

  4. Nagl, M.: Formal Languages of Labelled Graphs. Computing16, 113–137 (1976).

    Article  Google Scholar 

  5. Pfaltz, J. L., Rosenfeld, A.: Web Grammars. Proc. Int. Joint Conf. art. Int., 609–619, Washington 1969.

  6. Pratt, T. W.: Pair Grammars, Graph Languages and String-to-graph Translators. J. Comp. Syst. Sci.5, 560–595 (1971).

    Google Scholar 

  7. Rosen, B. K.: Deriving Graphs from Graphs by Applying a Production. Acta Informatica4, 337–357 (1975).

    Article  Google Scholar 

  8. Rosenfeld, A., Milgram, D. L.: Web Automata and Web Grammars. Machine Intelligence7, 307–324 (1972).

    Google Scholar 

  9. Schneider, H. J., Ehrig, H.: Grammars on Partial Graphs. Acta Informatica6, 297–316 (1976).

    Article  Google Scholar 

  10. Nagl, M.: Graph Rewriting Systems and their Application in Biology, in Lecture Notes in Biomathematics, 11, p. 135–156. Berlin-Heidelberg-New York: Springer 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics and Computer Science, University of Delaware, 19711, Newark, DE, USA

    S. Levy

  2. Department of Computer and Information Science, University of Pennsylvania, 19147, Philadelphia, PA, USA

    Kang Yueh

Authors
  1. S. Levy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kang Yueh
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Partially supported by NSF Grant MCS 76-19466 and MCS 77-04834.

Visiting University of Pennsylvania, 1976–77.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levy, S., Yueh, K. On labelled graph grammars. Computing 20, 109–125 (1978). https://doi.org/10.1007/BF02252341

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation