Dynamic labeled 2-structures

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

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

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

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

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

[5]  Joost Engelfriet,et al.  Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

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

[7]  Azriel Rosenfeld,et al.  Graph Grammars and Their Application to Computer Science , 1990, Lecture Notes in Computer Science.

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

[9]  Wolfgang Reisig.  Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.

[10]  Rolf H. Möhring,et al.  A Fast Algorithm for the Decomposition of Graphs and Posets , 1983, Math. Oper. Res..