Hans-Jorg Kreowski. A pumping lemma for context-free graph languages. LNCS 73, 270--283, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Net Refinement By Pullback Rewriting - Renate Klempien-Hinrichs.. (1998) (2 citations) (Correct)
....a comprehensive overview) one can distinguish between approaches in which arbitrary subgraphs may be replaced, and approaches to rewrite elementary subgraphs, i.e. vertices, hyper) edges, or handles. Hyper)edge rewriting is a special case of the doublepushout approach to graph rewriting (cf. [Kre79, Hab92]) it has been generalized to handle rewriting in [CER93] With the pullback approach introduced in [Bau95] a category theoretical framework is being developed for vertex rewriting, too, and in both graphs and hypergraphs (cf. BJ96] A Petri net is usually defined as a bipartite graph (the ....
Hans-Jorg Kreowski. A pumping lemma for context-free graph languages. LNCS 73, 270--283, 1979.
Algorithms for Managing the Evolution of Software Designs - Spiros Mancoridis (Correct)
....Tube Graphs In this section, we give a mathematical formulation of well formed tube graphs based on graph grammars [2] This formulation implies a construction algorithm for generating exactly the set of all well formed tube graphs. 1 A context sensitive graph grammar CSG = N; M;P;S) [6, 3] consists of a set N of non terminal edges, a set M of terminal edges, a set P of contextsensitive productions, and the initial non terminal edge S2N . The left hand side of a context sensitive production is any graph that contains at least one non terminal edge from N , and possibly terminal ....
Kreowski, H. A Pumping Lemma for Context-Free Graph Languages. In Graph-Grammars and Their Application to Computer Science and Biology (Berlin, Germany, 1978), Springer--Verlag, pp. 270--283.
Using Tube Graphs to Model Architectural Designs of Software.. - Richard Holt (1994) (Correct)
....a construction algorithm for generating exactly the set of all well formed tube graphs. 6 It differs from the logic predicate formulation in Section 4, which declaratively specifies the necessary conditions for a tube graph to be well formed. A context sensitive graph grammar CSG= N;M;P;S) [11, 6] consists of a set N of nonterminal edges, a set M of terminal edges, a set P of context sensitive productions, and the initial non terminal edge S2N . The left hand side of a context sensitive production is any graph that contains at least one non terminal edge from N , and possibly terminal ....
Kreowski, H. A Pumping Lemma for Context-Free Graph Languages. In GraphGrammars and Their Application to Computer Science and Biology (Berlin, Germany, 1978), Springer--Verlag, pp. 270--283.
Practical Use of Graph Rewriting - Dorothea Blostein, Hoda Fahmy, Ann.. (1995) (7 citations) (Correct)
....definition of context free graph grammars given by the NLC grammars of Section#A.3. Edge replacement grammars are considered analogous to contextfree string grammars. Carrying string grammar properties over to edge replacement graph grammars, Chomsky s pumping lemma has a graph grammar analogue [Kreo79], but no analogue of Chomsky normal form has been defined. A B C D (a) The rewriting rule A B D C B C B D C B C B C D (b) the initial graph (c) the resulting graph Figure#A.8 An application of an edge replacement rewriting rule. Shaded nodes in (a) represent the injective mapping of the ....
H.-J. Kreowski, "A Pumping Lemma for Context-free Graph Languages," in [IWGG79], pp. 270-283.
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