A survey of NLC grammars

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


Derivation Step Graph Grammar Graph Language Connection Relation Terminal Label 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CER]
    V. Claus, H. Ehrig and G. Rozenberg (eds.), Graph Grammars and Their Application to Computer Science and Biology, Springer Lecture Notes in Computer Science, vol. 73, 1979.Google Scholar
  2. [N]
    M. Nagl, Graph-Grammatiken, Vieweg und Sohn, Braunschweig-Wiesbaden, 1979.Google Scholar
  3. [JR1]
    D. Janssens and G. Rozenberg, On the Structure of Node-Label Controlled Graph Grammars, Information Sciences 20, 191–216, 1980.CrossRefGoogle Scholar
  4. [JR2]
    D. Janssens and G. Rozenberg, Restrictions, Extensions and Variations of NLC Grammars, Information Sciences 20, 217–244, 1980.CrossRefGoogle Scholar
  5. [JR3]
    D. Janssens and G. Rozenberg, Decision Problems for NLC Grammars, Journal of Computer and System Sciences 20, 144–177, 1981.CrossRefGoogle Scholar
  6. [JR4]
    D. Janssens and G. Rozenberg, Context-free NLC grammars, to appear.Google Scholar
  7. [JR5]
    D. Janssens and G. Rozenberg, Graph Grammars with neighbourhood-controlled embedding, Theoretical Computer Science 21, 55–74, 1982.CrossRefGoogle Scholar
  8. [EJKR]
    H. Ehrig, D. Janssens, H.J. Kreowski and G. Rozenberg, Concurrency of Node-label-controlled Graph Transformations, Technical report 82-38, U.I.A., Antwerp, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • D. Janssens
    • 1
  • G. Rozenberg
    • 1
  1. 1.Institute of Applied Mathematics and Computer ScienceUniversity of LeidenLeidenThe Netherlands

Personalised recommendations