Theoretical Computer Science
Direction independent context-sensitive grammars
Information and Control
Handle NLC grammers and R. E. languages
Journal of Computer and System Sciences
Characteristics of graph languages Generated by edge replacement
Theoretical Computer Science
Edge-label controlled graph grammars
Journal of Computer and System Sciences
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Proceedings of the International Workshop on Graph Transformations in Computer Science
A Tutorial and Bibliographical Survey on Graph Grammars
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Tutorial introduction to the algebraic approach of graph grammars
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
May we introduce to you: hyperedge replacement
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Graph Rewriting Systems with Priorities
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
The Power and the Limitations of Local Computations on Graphs
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Hi-index | 0.00 |
Graph relabeling systems (GRS's) have been introduced as a suitable tool for coding and proving sequential or distributed algorithms on graphs or networks. These systems do not change the underlying structure of the graph on which they work, but only the labeling of its components (edges or vertices). Each relabeling step is fully determined by the knowledge of a fixed size subgraph, the relabeled occurrence. We introduce an extension of that model, the so-called expanding graph relabeling systems (e-GRS's), which allows the generation of sets of graphs by means of component relabeling. We study the generating power of these systems and prove that they enable us to generate any recursively enumerable set of graphs. We first show how the “from left to right” natural orientation of a string-graph, that is a graph representation of a string, can be translated by means of vertex labels in such a way that any local transformation of the string can be simulated by a local relabeling of the string-graph vertices. Using this translation, we show that any phrase-structure string grammar can be simulated by an e-GRS. Finally, we provide a way of encoding graphs as strings and an e-GRS, called the decoder, which can convert any string representation of the encoding of a graph into the graph itself.