Skip to main content

Graph grammars

  • Section B Computation Theory in Category
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

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

Included in the following conference series:

Abstract

I wish to thank J. Dörr who taught me to apply mathematical methods to problems of practical relevance, and H.Ehrig and M.Nagl for having considerably stimulated the theory of graph grammars. The latter and H.Göttler have given helpful suggestions in preparing this manuscript.

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.

References

  1. J.W.Backus: The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM conference Proc. Int. Conf. Inform. Proc. Paris 1959, p.125–132, München, 1960

    Google Scholar 

  2. A. Blaser/H. Schmutz: Data base research — a survey Lect. Notes Comput. Sc. 39, p.44–113, Berlin, 1976

    Google Scholar 

  3. H.W. Brügmann/A. Rudert/H. Lehr: EHBIS — high level picture programming Informatik-Fachberichte 1, p.156–165, Berlin, 1976

    Google Scholar 

  4. H. Bunke: Beschreibung eines syntaxgesteuerten inkrementellen Compilers durch Graph-Grammatiken Arb.ber. Inst. Math. Masch. Dat.verarb., Univ. Erlangen 7, 7 (1974)

    Google Scholar 

  5. D.D. Chamberlain: Relational data-base management systems Computing Surveys 8, 1 (1976), p.43–66

    Google Scholar 

  6. N. Chomsky: Three models for the description of languages IRE Transact. Inform. Theory IT-2 (1956), p.113–124

    Google Scholar 

  7. N. Chomsky: On certain formal properties of grammars Information Control 2 (1959), p.137–167

    Google Scholar 

  8. N.Chomsky: On formal properties of grammars Handbook of Mathematical Psychology (Eds.: R.D.Luce, R.R.Bush, E.Galanter), p.324–418, New York, 1963

    Google Scholar 

  9. E. Denert/R. Franck/W. Streng: PLAN2D — Ein Ansatz zur Definition einer zweidimensionalen Programmiersprache Lect. Notes Comput. Sc. 26, p.201–213, Berlin, 1975

    Google Scholar 

  10. R. Durchholz/G. Richter: Das Datenmodell der "Feature analysis of generalized data base management systems" Angewandte Informatik 12 (1972), p.553–568

    Google Scholar 

  11. H.Ehrig/M.Pfender/H.J.Schneider: Graph grammars — an algebraic approach Proc. Conf. Switch. Automat. Theory 1973, p.167–180

    Google Scholar 

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

    Google Scholar 

  13. T.G. Evans: A grammar-controlled pattern analyzer Information Processing 68, vol.II, p.1592–1598, Amsterdam, 1969

    Google Scholar 

  14. J.Feder: Plex languages Information Sciences (1971), p.225–241

    Google Scholar 

  15. R.Franck: PLAN2D — Syntaxanalyse von Präzedenz-Graph-Grammatiken Dissertation, TU Berlin, 1975

    Google Scholar 

  16. T.Frühauf: Formale Beschreibung von Informationsstrukturen mit Hilfe von Graph-Ersetzungsmechanismen Arb.ber. Inst. Math. Masch. Dat.verarb., Univ. Erlangen 9,1 (1976)

    Google Scholar 

  17. H.Göttler: Zweistufige Graph-Manipulationssysteme für die Semantik von Programmiersprachen Dissertation, Univ. Erlangen, 1977

    Google Scholar 

  18. E. Grötsch: Vergleichende Studie über parallele Ersetzung markierter Graphen Arb.ber. Inst. Math. Masch. Dat.verarb., Univ. Erlangen 9, 6 (1976), p.1–152

    Google Scholar 

  19. P.Lucas/K.Walk: On the formal description of PL/I Annual Review Automat. Programming 6, 3 (1969)

    Google Scholar 

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

    Google Scholar 

  21. M. Nagl: Formal languages of labelled graphs Computing 16 (1976), p.113–137

    Google Scholar 

  22. M.Nagl: On a generalization of Lindenmayer-systems to labelled graphs Automata, Languages, Development (Eds.: A.Lindenmayer, G.Rozenberg), p.487–508, Amsterdam, 1976

    Google Scholar 

  23. M. Nagl: Graph rewriting systems and their application in biology Lect. Notes Biomathematics 11 (1976), p.135–156, Berlin, 1976

    Google Scholar 

  24. R. Narasimhan: Labeling schemata and syntactic description of pictures Information Control 7 (1964), p.151–179

    Google Scholar 

  25. R. Narasimhan: Syntax-directed interpretation of classes of pictures Communicat. Associat. Comput. Mach. 9,3 (1966), p.166–173

    Google Scholar 

  26. P.Naur (Ed.): Report on the algorithmic language ALGOL 60 Numer. Mathematik 2 (1960), p.106–136

    Google Scholar 

  27. H.Niemann: Methoden der Mustererkennung Frankfurt, 1974

    Google Scholar 

  28. J.L.Pfaltz/A.Rosenfeld: Web grammars Proc. Int. Joint Conf. Artificial Intelligence 1969, p.609–619

    Google Scholar 

  29. T.W. Pratt: Pair grammars, graph languages and string-to-graph translations J. Comput. System Sc. 5 (1971), p.560–595

    Google Scholar 

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

    Google Scholar 

  31. A. Rosenfeld: Progress in picture processing 1969–71 Computing Surveys 5,2 (1973), p.81–108

    Google Scholar 

  32. H.J.Schneider: Chomsky-languages for multidimensional input-media Internat. Comput. Symposium 1970, p.599–608

    Google Scholar 

  33. H.J.Schneider: Formal systems for structure manipulation Display Use for Man-Machine Dialog 1971 (Eds.: W.Händler, J.Weizenbaum), p.125–143, München, 1972

    Google Scholar 

  34. H.J. Schneider: A necessary and sufficient condition for Chomsky-productions over partially ordered symbol sets Lect. Notes Econom. Math. Systems 78 (1973), p.90–98, Berlin, 1973

    Google Scholar 

  35. H.J. Schneider: Syntax-directed description of incremental compilers Lect. Notes Comput. Sc. 26 (1975), p.192–201, Berlin, 1975

    Google Scholar 

  36. H.J.Schneider: Conceptual data base description using graph grammars Graphen, Algorithmen, Datenstrukturen (Ed.:H.Noltemeier), p.77–97, München, 1976

    Google Scholar 

  37. H.J. Schneider/H. Ehrig: Grammars on partial graphs Acta Informatica 6,2 (1976), p.297–316

    Google Scholar 

  38. A.C. Shaw: A formal picture description scheme as a basis for picture processing systems Information Control 14,1 (1969), p.9–52

    Google Scholar 

  39. A.C. Shaw: Parsing of graph-representable pictures J. Associat. Comput. Mach. 17,3 (1970), p.453–481

    Google Scholar 

  40. R.W. Taylor/R.L. Frank: CODASYL data-base management systems Computing Surveys 8,1 (1976), p.67–103

    Google Scholar 

  41. D.C. Tsichritzis/F.H. Lochovsky: Hierarchical data-base management Computing Surveys 8,1 (1976), p.105–123

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marek Karpiński

Additional information

To J. Dörr on the occasion of his 65th birthday

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schneider, H.J., Erlangen (1977). Graph grammars. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_99

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_99

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics