Author:
Ehrenfeucht A.,Rozenberg G.
Abstract
The notion of adynamic 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.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference12 articles.
1. Angular 2-structures
2. Litovsky I. , Metivier Y. and Sopena E. (1994) Different local controls for graph relabeling systems. Mathematical Systems Theory (to appear).
3. Graph grammars and their application to computer science;Ehrig;Springer- Verlag Lecture Notes in Computer Science,1991
4. T-structures, T-functions, and texts
5. Engelfriet J. and Rozenberg G. (1991) Graph grammars based on node rewriting: an introduction to NLC graph grammars. In Ehrig et al. (1991) 12–23.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On switching classes, NLC-width, cliquewidth and treewidth;Theoretical Computer Science;2012-04
2. Preface;Theoretical Computer Science;2012-04
3. Subgroup Switching of Skew Gain Graphs;Fundamenta Informaticae;2012
4. Finite metrics in switching classes;Discrete Applied Mathematics;2007-01
5. Embedding in Switching Classes with Skew Gains;Lecture Notes in Computer Science;2004