Skip to main content

Node-label controlled graph grammars (Extended abstract)

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1980 (MFCS 1980)

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

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. V. Claus, H. Ehrig and G. Rozenberg, Graph-Grammars and Their Application to Computer Science and Biology, Lecture Notes in Computer Science vol. 73, Springer-Verlag, Berlin-Heidelberg-New York, 1979.

    Google Scholar 

  2. M. Nagl, Graph-Grammatiken, Vieweg und Sohn, Braunschweig, 1979.

    Google Scholar 

  3. Schneider, Syntax-directed Description of Incremental Compilers, Lecture Notes in Computer Science vol. 26, 192–201, Springer-Verlag, Berlin 1975.

    Google Scholar 

  4. Schneider, Conceptual Data-Base Description Using Graph Grammars, in H. Noltemeier: Graphen, Algorithmen, Datenstrukturen, Applied Computer Science 4, 77–98, Muenchen: Hansen Verlag 1976.

    Google Scholar 

  5. C. Battini, A. d'Atri, Rewriting Systems as a Tool for Relational Data Base Design, 139–154, in [CER].

    Google Scholar 

  6. H.D. Ehrich, V.G. Lohberger, Constructing Specifications of Abstract Data Types by replacements, 180–191, in [CER].

    Google Scholar 

  7. A.L. Furtado, Transformations of Data Base Structures, 224–236, in [CER].

    Google Scholar 

  8. T.W. Pratt, Definition of Programming Language Semantics Using Grammars for Hierarchical Graphs, 389–400, in [CER].

    Google Scholar 

  9. J.C. Wileden, Relationship between Graph Grammars and the Design and Analysis of Concurrent Software, 456–463, in [CER].

    Google Scholar 

  10. Genrich, Thiagarajan, Bipolar Synchronization Systems, technical report, GMD Bonn, 1979.

    Google Scholar 

  11. A. Rosenfeld, D. Milgram, Web Automata and Weg Grammars, Machine Intelligence 7, 307–324, 1972.

    Google Scholar 

  12. D. Janssens, G. Rozenberg, On the Structure of Node-Label Controlled Graph Languages, Information Sciences, to appear.

    Google Scholar 

  13. D. Janssens, G. Rozenberg, Restrictions Extension and Variations of NLC grammars, Information Sciences, to appear.

    Google Scholar 

  14. D. Janssens, G. Rozenberg, Decision Problems for Node-Label Controlled Graph Grammars, technical report, UIA Antwerp, 1979.

    Google Scholar 

  15. R. Franck, A Class of Linearly Parsible Graph Grammars, Acta Informatica 10 (1978), 175–201.

    Google Scholar 

  16. H.J. Kreowski, A Pumping Lemma for Context-Free Graph Languages, 270–283, in [CER].

    Google Scholar 

  17. P. Della Vigna, C. Ghezzi, Context-Free Graph Grammars, Information and Control 37, 207–233, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janssens, D., Rozenberg, G. (1980). Node-label controlled graph grammars (Extended abstract). In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022515

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics