Advertisement

Graph grammars with node-label controlled rewriting and embedding

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

Keywords

Direct Neighbour Graph Grammar Graph Language Connection Relation Host Graph 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CER]
    Claus, V., Ehrig, H. and Rozenherg, G. (Eds.), Graph grammars and their application to computer science and biology, Lecture Notes in Computer Science, v. 73, 1979.Google Scholar
  2. [CL]
    Culik II, K. and Lindenmayer, A., Parallel graph generating and graph recurrence systems for multicellular development, International Journal of General Systems, v. 3, 53–66, 1976.Google Scholar
  3. [E]
    Ehrig, H., Introduction to the algebraic theory of graph grammars (a survey), in CER.Google Scholar
  4. [EJKR]
    Ehrig, H., Janssens, D., Kreowski, H.-J. and Rozenberg, G., Concurrency of node-label controlled graph transformations, University of Antwerp, U.I.A., Technical Report 82–38, 1982.Google Scholar
  5. [EK]
    Ehrig, H. and Kreowski, H.-J., Parallelism of manipulations in multidimensional information structures, Lecture Notes in Computer Science, v. 45, 284–293, 1976.Google Scholar
  6. [GJTR]
    Genrich, H., Janssens, D., Thiagarajan, P.S. and Rozenberg, G., Generalized handle grammars and their relation to Petri Nets, Institut für Informationssystemforschung, GMD Bonn, Technical Report 82-06, 1982.Google Scholar
  7. [JR1]
    Janssens, D. and Rozenberg, G., On the structure of node-label controlled graph languages, Information Sciences, v. 20, 191–216, 1980.Google Scholar
  8. [JR2]
    Janssens, D. and Rozenberg, G., Restrictions,extensions and variations of NLC grammars, Information Sciences, v. 20, 217–244, 1980.Google Scholar
  9. [JR3]
    Janssens, D. and Rozenberg, G., Decision problems for node-label controlled graph grammars, Journal of Computer and System Sciences, v. 22, 144–177, 1981.Google Scholar
  10. [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.Google Scholar
  11. [JR5]
    Janssens, D. and Rozenberg, G., Graph grammars with neighbourhood controlled embedding, Theoretical Computer Science, v. 21, 55–74, 1982.Google Scholar
  12. [JR6]
    Janssens, D. and Rozenberg, G., Context-free NLC grammars, University of Leiden, Institute of Applied Mathematics and Computer Science, Technical Report, 1983.Google Scholar
  13. [JR7]
    Janssens, D. and Rozenberg, G., Bounded degree is decidable for NLC grammars, Institute of Applied Mathematics and Computer Science, University of Leiden, Technical Report, 1983.Google Scholar
  14. [JRV1]
    Janssens, D., Rozenberg, G. and Verraedt, R., On sequential and parallel node-rewriting graph grammars, part 1, Computer Graphics and Image Processing, v. 12, 279–301, 1982.Google Scholar
  15. [JRV2]
    Janssens, D., Rozenberg, G. and Verraedt, R., On sequential and parallel node-rewriting graph grammars, part 2, Computer Graphics and Image Processing, to appear.Google Scholar
  16. [K]
    Kreowski, H.-J., Manipulationen van graphmanipulationen, Ph.D. Thesis, Technical University of Berlin, Computer Science Department, 1977.Google Scholar
  17. [N]
    Nagl, M., Graph-Grammatiken, Vieweg und Sohn, Braunschweig-Wiesbaden, 1979.Google Scholar
  18. [RM]
    Rosenfeld, A. and Milgram, D., Web automata and web grammars, Machine Intelligence, v. 7, 307–324, 1972.Google Scholar
  19. [RS]
    Rozenberg, G. and Salomaa, A., The mathematical theory of L systems, Academic Press, London-New York, 1981.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