graph(Ed) is a powerful interactive editor for drawing and manipulating graphs and graphgrammars. It helps designing graphs, networks, data structures, entity relationship diagrams, petri nets, electrical circuits, V...
详细信息
ISBN:
(纸本)9783540544784
graph(Ed) is a powerful interactive editor for drawing and manipulating graphs and graphgrammars. It helps designing graphs, networks, data structures, entity relationship diagrams, petri nets, electrical circuits, VLSI circuits, flowcharts or even arbitrary diagrams. Its unique feature is the ability to handle graphgrammars. they are useful both for theoretical investigations and as parametrisized graph macros.
An elementary introduction to the notion of an NLC graph grammar is given, and several of its extensions and variations are discussed in a systematic way. Simple concepts are considered rather than technical details. ...
详细信息
the infinite tree obtained classically by unfolding the definition of a recursive scheme, contains several identical subtrees. When they are identified, the resulting graph is generated by a deterministic graph gramma...
详细信息
Actor grammars are a model of actor systems based on graph rewriting. Computation graphs model rewriting processes in actor grammars, and hence, computations in actor systems. the relationship between computation grap...
详细信息
ISBN:
(纸本)9783540544784
Actor grammars are a model of actor systems based on graph rewriting. Computation graphs model rewriting processes in actor grammars, and hence, computations in actor systems. the relationship between computation graphs and structured transformations, as introduced in [JR 89], is investigated. A structured transformation may be viewed as a description of the external effect of of a computation described by a computation graph.
this paper is concerned withthe efficient determination of the set of productions of a graph grammar that are applicable in one rewriting step. We propose a new algorithm that is a generalization of a similar algorit...
详细信息
ISBN:
(纸本)9783540544784
this paper is concerned withthe efficient determination of the set of productions of a graph grammar that are applicable in one rewriting step. We propose a new algorithm that is a generalization of a similar algorithm originally developed for forward chaining production systems. the time complexity of the proposed method is not better than that of a naive solution, in the worst case. In the best case, however, a significant speedup can be achieved. Some experiments supporting the results of a theoretical complexity analysis are described.
暂无评论