Node-label controlled graph grammars (Extended abstract)

  • D. Janssens
  • G. Rozenberg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 88)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CER]
    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. [NA]
    M. Nagl, Graph-Grammatiken, Vieweg und Sohn, Braunschweig, 1979.Google Scholar
  3. [SC1]
    Schneider, Syntax-directed Description of Incremental Compilers, Lecture Notes in Computer Science vol. 26, 192–201, Springer-Verlag, Berlin 1975.Google Scholar
  4. [SC2]
    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. [BA]
    C. Battini, A. d'Atri, Rewriting Systems as a Tool for Relational Data Base Design, 139–154, in [CER].Google Scholar
  6. [EL]
    H.D. Ehrich, V.G. Lohberger, Constructing Specifications of Abstract Data Types by replacements, 180–191, in [CER].Google Scholar
  7. [FU]
    A.L. Furtado, Transformations of Data Base Structures, 224–236, in [CER].Google Scholar
  8. [PR]
    T.W. Pratt, Definition of Programming Language Semantics Using Grammars for Hierarchical Graphs, 389–400, in [CER].Google Scholar
  9. [WI]
    J.C. Wileden, Relationship between Graph Grammars and the Design and Analysis of Concurrent Software, 456–463, in [CER].Google Scholar
  10. [GT]
    Genrich, Thiagarajan, Bipolar Synchronization Systems, technical report, GMD Bonn, 1979.Google Scholar
  11. [RM]
    A. Rosenfeld, D. Milgram, Web Automata and Weg Grammars, Machine Intelligence 7, 307–324, 1972.Google Scholar
  12. [JR1]
    D. Janssens, G. Rozenberg, On the Structure of Node-Label Controlled Graph Languages, Information Sciences, to appear.Google Scholar
  13. [JR2]
    D. Janssens, G. Rozenberg, Restrictions Extension and Variations of NLC grammars, Information Sciences, to appear.Google Scholar
  14. [JR3]
    D. Janssens, G. Rozenberg, Decision Problems for Node-Label Controlled Graph Grammars, technical report, UIA Antwerp, 1979.Google Scholar
  15. [FR]
    R. Franck, A Class of Linearly Parsible Graph Grammars, Acta Informatica 10 (1978), 175–201.Google Scholar
  16. [KR]
    H.J. Kreowski, A Pumping Lemma for Context-Free Graph Languages, 270–283, in [CER].Google Scholar
  17. [DG]
    P. Della Vigna, C. Ghezzi, Context-Free Graph Grammars, Information and Control 37, 207–233, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • D. Janssens
    • 1
  • G. Rozenberg
    • 2
  1. 1.Department of MathematicsUniversity of Antwerp (UIA)WilrijkBelgium
  2. 2.Institute of Applied Mathematics and Computer ScienceUniversity of LeidenLeidenThe Netherlands

Personalised recommendations