An Introduction to Dynamic Labled 2-Structures

The notion of a dynamic labeled 2-structure is introduced and investigated. It generalizes the notion of a labeled 2-structure (l2s), see [ER1], by making it possible to change the (label) relationships between the nodes. This is achieved by storing in the nodes of a l2s output and input functions which can change the outgoing and incoming labels, respectively. The notion of a clan which is central in the theory of l2s's is transferred to the framework of dl2s's, and the basic properties of clans of dl2s's are investigated.

[1]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[2]  Andrzej Ehrenfeucht,et al.  Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms , 1990, Theor. Comput. Sci..

[3]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

[4]  Andrzej Ehrenfeucht,et al.  Permutable transformation semigroups , 1993 .

[5]  Andrzej Ehrenfeucht,et al.  T-structures, T-functions, and texts , 1993, Theor. Comput. Sci..

[6]  Andrzej Ehrenfeucht,et al.  Square Systems , 1994, Fundam. Informaticae.

[7]  Andrzej Ehrenfeucht,et al.  Dynamic labeled 2-structures , 1994, Mathematical Structures in Computer Science.

[8]  Andrzej Ehrenfeucht,et al.  Angular 2-Structures , 1992, Theor. Comput. Sci..

[9]  Andrzej Ehrenfeucht,et al.  Theory of 2-Structures, Part II: Representation Through Labeled Tree Families , 1990, Theor. Comput. Sci..