H. Bunke, "On the Generative Power of Sequential and Parallel Programmed Graph Grammars," Computing, Vol. 29, 1982, pp. 89-112.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....t; c; d) with s(e i ) v i Gamma1 , t(e i ) v i , c(v i ) ffl, and d(e i ) a i for i = 1; n. For the empty string , graph( denotes the graph with one node and no edges. For a string language L, graph(L) denotes the set fgraph(w)jw 2 Lg. 2. programmed graph grammars (see Bunke [4] [5]) 3. graph grammars with priorities (see Litovsky and M etivier [17] Nevertheless, a number of results can be adapted from formal language theory. In particular, it is not surprising that context free graph grammars with application conditions are more powerful than ordinary context free ....

....of degree k. The question remains, under which conditions right sided application condition may be expressed by equivalent left sided ones. Graph grammars with application conditions provide one possibility to restrict the applicability of productions. Programmed graph grammars (see Bunke [4] [5]) and graph grammars with priorities (see Litovsky and M etivier [17] provide other possibilities. In the first case, an application of a production may determine which productions are applicable at the next step; in the second case, a finite set of graph productions is equipped with a partial ....

Horst Bunke. On the generative power of sequential and parallel programmed graph grammars. Computing 29, 89--112, 1982.

....applied, 2. by determining the next rule in dependence on the previous one(s) or 3. by applying a rule according to its priority. Prototypes of such transformation systems are matrix systems as considered in formal language theory, programmed graph transformation systems (see e.g. Bunke [Bun79, Bun82] and Schurr [Sch97] and graph transformation systems with priorities (see Litovsky and M etivier [LM93] 4 4 In Section 4, we introduce the notion of a transformation unit that encapsulates the four discussed components of graph transformation systems, i.e. a set of rules, descriptions of ....

Horst Bunke. On the generative power of sequential and parallel programmed graph grammars. Computing, 29:89--112, 1982.

....of rules in a derivation, determining the next rule by the previous one(s) or choosing the rule in dependence of its priority. Prototypes of such transformation systems are matrix systems as considered in formal language theory, programmed graph transformation systems (see e.g. Bunke [Bun79, Bun82] and Schurr [Sch95] and graph transformation systems with priorities (see Litovsky and M etivier [LM93] 2.4 Properties of Graph Transformation In the following, different properties of graph transformation are discussed which are of interest if graph transformation is considered as a ....

Horst Bunke. On the generative power of sequential and parallel programmed graph grammars. Computing 29, 89--112, 1982.

....applied, 2. by determining the next rule in dependence on the previous one(s) or 3. by applying a rule according to its priority. Prototypes of such transformation systems are matrix systems as considered in formal language theory, programmed graph transformation systems (see e.g. Bunke [Bun79, Bun82] and Schurr [Sch96] and graph transformation systems with priorities (see Litovsky and M etivier [LM93] 4 2.4 Properties of Graph Transformation In the following, properties of graph transformation are discussed which are of interest if graph transformation is considered as a specification ....

Horst Bunke. On the generative power of sequential and parallel programmed graph grammars. Computing, 29:89--112, 1982.

No context found.

H. Bunke, "On the Generative Power of Sequential and Parallel Programmed Graph Grammars," Computing, Vol. 29, 1982, pp. 89-112.

No context found.

H. Bunke, "On the Generative Power of Sequential and Parallel Programmed Graph Grammars," Computing, Vol. 29, 1982, pp. 89-112.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC