Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Grammars on partial graphs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The concept of Chomsky-grammars is generalized to graph-grammars; the “gluing” of graphs is defined by a pushout-construction. In the present paper, we allow the left-hand and right-hand side of a production to be partial graphs, i.e. graphs in which there may be edges without a source or target node. A necessary and sufficient condition for applicability of productions is given. Furthermore, convex graph-grammars are studied.

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

Access this article

Log in via an institution

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Similar content being viewed by others

References

  1. Denert, E., Franck, R., Streng, W.: PLAN2D — Ein Ansatz zur Definition einer zweidimensionalen Programmiersprache. Ges. f. Informatik, Jahrestagung 1974, Berlin. Lecture Notes in Computer Science 26. Berlin-Heidelberg-New York: Springer 1975. p. 202–213

    Google Scholar 

  2. Ehrig, H., Pfender, M., Schneider, H. J.: Kategorielle Konstruktionen in der Theorie der Graph-Grammatiken. Arb.berichte Inst. Math. Masch. Dat.verarb., Univ. Erlangen, vol. 6, No. 3 (1973), p. 30–55

  3. Ehrig, H., Pfender, M., Schneider, H. J.: Graph-Grammars — an algebraic approach. Froc. Conf. Switch. Automat. Theory 1973, p. 167–180

  4. Ehrig, H., Tischer, K. W.: Graph-grammars applied to the specialization of organisms. Proc. Conf. Biologically Motivated Automata Theory, McLean (Virginia) 1974, p. 158–165

  5. Milgram, D., Rosenfeld, A.: Array automata and array grammars. Proc. IFIP Congress 1971, Amsterdam: Noth-Holland 1972, p. 69–74

    Google Scholar 

  6. Nagl, M.: Eine Präzisierung des Pfaltz-Rosenfeldschen Produktionsbegriffes bei mehrdimensionalen Grammatiken. Arb. berichte Inst. Math. Masch. Dat.verarb., Univ. Erlangen, 0vol. 6, No. 3 (1973), p. 56–71

    Google Scholar 

  7. Nagl, M.: Formale Sprachen von markierten Graphen. Arb.berichte Inst. Math. Masch. Dat.verarb., Univ. Erlangen, vol. 7, No. 4 (1974)

  8. Pfaltz, J. L., Rosenfeld, A.: Web grammars. Proc. Int. Joint Conf. Artifical Intelligence, Washington 1969, p. 609–619

  9. Pfaltz, J. L.: Convexity in directed graphs. J. Combinat. Theory 10, 143–162 (1971)

    Google Scholar 

  10. Pratt, T. W.: Pair grammars, graph languages, and string-to-graph translation. J. Computer System Sciences 5, 560–595 (1971)

    Google Scholar 

  11. Rosen, B. K.: Deriving graphs from graphs by applying a production. Acta Informatica 4, 337–357 (1975)

    Google Scholar 

  12. Schneider, H. J.: Chomsky-Systeme für partielle Ordnungen. Arb.berichte Inst. Math. Masch. Dat.verarb., Univ. Erlangen, vol. 3, No. 3 (1970)

  13. Schneider, H. J.: A necessary and sufficient condition for Chomsky-productions over partially ordered symbol sets. Ges. f. Informatik, Jahrestagung 1972. Lecture Notes in Economics and Mathematical Systems 78. Berlin-Heidelberg-New York: Springer 1973

    Google Scholar 

  14. Schneider, H. J.: Syntax-directed description of incremental compilers. Gesellschaft für Informatik, Jahrestagung 1974, Berlin. Lecture Notes in Computer Science 26, Berlin-Heidelberg-New York: Springer 1975, p. 192–201

    Google Scholar 

  15. Encarnacao, J.: Datenstrukturen für graphische Informationsverarbeitung. Gesellschaft für Informatik, Bericht No. 2, Fachtagung Computer Graphics, Berlin 1971, p. 15–49

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Math. Maschinen und Datenverarbeitung (II) der Univ. Erlangen-Nürnberg, Egerlandstr. 13, D-8520, Erlangen, Federal Republic of Germany

    H. J. Schneider

  2. Forschungsgruppe Automatentheorie und Formale Sprachen der TU Berlin, Otto-Suhr-Allee 18-20, D-1000, Berlin 10

    H. Ehrig

Authors
  1. H. J. Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Ehrig
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schneider, H.J., Ehrig, H. Grammars on partial graphs. Acta Informatica 6, 297–316 (1976). https://doi.org/10.1007/BF00288659

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation