An introduction to the NLC way of rewriting graphs

  • G. Rozenberg
Part I Tutorial Introductions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 291)

Abstract

This paper presents an introduction to the rewriting mechanism of Node-Label Controlled (NLC) graph grammars. First we present a more general framework (LEARRE graph grammars) from which NLC graph grammars are obtained through a number of restrictions. The paper is of a tutorial character with the stress on the intuitive (illustrated by examples) explanation of concepts rather than on the formalism.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. [ELR]
    Engelfriet, J., Leih, G., and Rozenberg, G., Apex graph grammars and attribute grammars, Dept. of Computer Science, University of Leiden, Techn. Report 87–04, 1987.Google Scholar
  2. [EMR]
    Ehrenfeucht, A., Main, M., and Rozenberg, G., Restrictions on NLC graph grammars, Theoretical Computer Science, v. 31, 211–223, 1984.CrossRefGoogle Scholar
  3. [GJRT]
    Genrich, H.J., Janssens, D., Rozenberg G., and Thiagarajan, P.S., Generalized handle grammars and their relation to Petri nets, Journal of Information Processing and Cybernetics — EIK, v. 4, 179–206, 1984.Google Scholar
  4. [JR1]
    Janssens, D., and Rozenberg G., On the structure of node-label controlled graph languages, Information Sciences, v. 20, 191–216, 1980.CrossRefGoogle Scholar
  5. [JR2]
    Janssens, D., and Rozenberg, G., Restrictions extensions and variations of NLC grammars, Information Sciences, v. 20, 217–244, 1980.CrossRefGoogle Scholar
  6. [JR3]
    Jansens, D., and Rozeberg G., Decision problems for node-label controlled graph grammars, Journal of Computer and System Sciences, v. 22, 144–177, 1981.CrossRefGoogle Scholar
  7. [JR4]
    Janssens, D., and Rozenberg, G., A characterization of context-free string languages by directed node-label controlled graph grammars, Acta Informatica, v. 16, 63–85, 1981.CrossRefGoogle Scholar
  8. [JR5]
    Janssens, D., and Rozenberg, G., Graph grammars with neighbourhood controlled embedding, Theoretical Computer Science, v. 21, 55–74, 1982.CrossRefGoogle Scholar
  9. [JR6]
    Janssens, D., and Rozenberg, G., Neighbourhood-Uniform NLC Grammars, Computer Vision, Graphics, and Image Processing, v. 35, 131–151, 1986.Google Scholar
  10. [JRV]
    Janssens, D., Rozenberg, G., and Verraedt, R., On sequential and parallel node-rewriting graph grammars, Computer Graphics and Image Processing, v. 18, 279–304, 1982.CrossRefGoogle Scholar
  11. [RM]
    Rosenfeld, A., and Milgram, D.L., Web automata and web grammars, Machine Intelligence, v. 7, 307–324, 1972.Google Scholar
  12. [RW1]
    Rozenberg, G., and Welzl, E., Boundary NLC graph grammars — basic definitions, normal forms, and complexity, Information and Control, v. 69, 136–167, 1986.CrossRefGoogle Scholar
  13. [RW2]
    Rozenberg, G., and Welzl, E., Graph theoretic closure properties of the family of boundary NLC languages, Acta Informatica, v. 23, 289–309, 1986.CrossRefGoogle Scholar
  14. [RW3]
    Rozenberg, G., and Welzl, E., Combinatorial properties of boundary NLC graph languages, Discrete Applied Mathematics, v. 16, 59–73, 1987.CrossRefGoogle Scholar
  15. [W]
    Welzl, E., On the set of all subgraphs of the graphs in a boundary NLC graph language, in The Book of L (Rozenberg, G., and Salomaa, A., eds.), Springer Verlag, Berlin, Heidelberg, 445–459, 1986.Google Scholar

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • G. Rozenberg
    • 1
  1. 1.Department of Computer ScienceUniversity of LeidenLeidenThe Netherlands

Personalised recommendations