On Partially Ordered Graph Grammars

Graph grammars are systems for the generation of directed, node and edge labeled graphs. They rewrite single nodes only and establish connections between the inserted graph and the neighbors of the replaced node on the basis of node labels and edge labels. If there is only a single edge label, then graph grammars are closely related to NLC graph grammars.

[1]  J. J. Edwards,et al.  An algorithm for the inference of tree grammars , 1976, International Journal of Computer & Information Sciences.

[2]  Grzegorz Rozenberg,et al.  Graph Grammars with Neighbourhood-Controlled Embedding , 1982, Theor. Comput. Sci..

[3]  Andrzej Ehrenfeucht,et al.  Restrictions on NLC Graph Grammars , 1984, Theor. Comput. Sci..

[4]  Grzegorz Rozenberg,et al.  Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity , 1986, Inf. Control..

[5]  Andrzej Ehrenfeucht,et al.  On the membership problem for regular DNLC grammars , 1986, Discret. Appl. Math..

[6]  Frank Harary,et al.  Graph Theory , 2016 .

[7]  Hartmut Ehrig,et al.  Graph-Grammars and Their Application to Computer Science and Biology , 1978, Lecture Notes in Computer Science.

[8]  Franz-Josef Brandenburg.  On the Complexity of the Membership Problem of Graph Grammars , 1983, WG.

[9]  Grzegorz Rozenberg,et al.  Restrictions, extensions, and variations of NLC grammars , 1980, Inf. Sci..

[10]  Manfred Kaul.  Practical Applications of Precedence Graph Grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Grzegorz Rozenberg,et al.  Decision Problems for Node Label Controlled Graph Grammars , 1981, J. Comput. Syst. Sci..

[13]  King-Sun Fu,et al.  Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Grzegorz Rozenberg,et al.  On the structure of node-label-controlled graph languages , 1980, Inf. Sci..

[15]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[16]  Helmut J. Ludwigs.  Properties of Ordered Graph Grammars , 1980, WG.

[17]  Klaus-Jörn Lange,et al.  String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing , 1987, Discret. Appl. Math..

[18]  Manfred Nagl.  Graph-Grammatiken: Theorie, Anwendungen, Implementierung , 1979 .

[19]  Grzegorz Rozenberg,et al.  Combinatorial properties of boundary NLC graph languages , 1987, Discret. Appl. Math..

[20]  A. O. Slisenko.  Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems , 1982, Inf. Process. Lett..