This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Ehrig, H., Introduction to the algebraic theory of graph grammars (a survey), in CER.
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.
Ehrig, H. and Kreowski, H.-J., Parallelism of manipulations in multidimensional information structures, Lecture Notes in Computer Science, v. 45, 284–293, 1976.
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.
Janssens, D. and Rozenberg, G., On the structure of node-label controlled graph languages, Information Sciences, v. 20, 191–216, 1980.
Janssens, D. and Rozenberg, G., Restrictions,extensions and variations of NLC grammars, Information Sciences, v. 20, 217–244, 1980.
Janssens, D. and Rozenberg, G., Decision problems for node-label controlled graph grammars, Journal of Computer and System Sciences, v. 22, 144–177, 1981.
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.
Janssens, D. and Rozenberg, G., Graph grammars with neighbourhood controlled embedding, Theoretical Computer Science, v. 21, 55–74, 1982.
Janssens, D. and Rozenberg, G., Context-free NLC grammars, University of Leiden, Institute of Applied Mathematics and Computer Science, Technical Report, 1983.
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.
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.
Janssens, D., Rozenberg, G. and Verraedt, R., On sequential and parallel node-rewriting graph grammars, part 2, Computer Graphics and Image Processing, to appear.
Kreowski, H.-J., Manipulationen van graphmanipulationen, Ph.D. Thesis, Technical University of Berlin, Computer Science Department, 1977.
Nagl, M., Graph-Grammatiken, Vieweg und Sohn, Braunschweig-Wiesbaden, 1979.
Rosenfeld, A. and Milgram, D., Web automata and web grammars, Machine Intelligence, v. 7, 307–324, 1972.
Rozenberg, G. and Salomaa, A., The mathematical theory of L systems, Academic Press, London-New York, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janssens, D., Rozenberg, G. (1983). Graph grammars with node-label controlled rewriting and embedding. In: Ehrig, H., Nagl, M., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1982. Lecture Notes in Computer Science, vol 153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000107
Download citation
DOI: https://doi.org/10.1007/BFb0000107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12310-1
Online ISBN: 978-3-540-39897-4
eBook Packages: Springer Book Archive