Abstract
We consider the problem of making the notion of dynamic labeled 2-structure even more dynamic by allowing the domain of a dynamic labeled 2-structure to vary by either adding new elements or deleting some elements. To this aim we study in the framework of dynamic labeled 2-structures the operation of disjoint union (in combination with group-theoretic operations induced by selectors) and a more general operation of amalgamated union.
Preview
Unable to display preview. Download preview PDF.
References
A. Ehrenfeucht, T. Harju and G. Rozenberg, Quotients and plane trees of group labeled 2-structures, Leiden University, Department of Computer Science, Technical Report No. 03, 1994.
A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures, parts I and II, Theoretical Computer Science, v. 70, 277–342, 1990.
A. Ehrenfeucht and G. Rozenberg, Dynamic labeled 2-structures, Mathematical Structures in Computer Science, to appear.
J. Engelfriet and G. Rozenberg, Graph grammars based on node rewriting: an introduction to NLC graph grammars, in [EKR].
H. Ehrig, H.-J. Kreowski and G. Rozenberg (Eds.), Graph grammars and their application to computer science, Lecture Notes in Computer Science 532, Springer Verlag, Heidelberg, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ehrenfeucht, A., Rozenberg, G. (1994). Dynamic labeled 2-structures with variable domains. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_40
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive