Nonterminal Separation in Graph Grammars

Abstract The notion of nonterminal separation in eNCE graph grammars is introduced: such a graph grammar is k -separated (with k ⩾1) if the distance between any two nonterminal nodes in any of its sentential forms is at least k (2-separated eNCE grammars are known as boundary eNCE graph grammars). There exists a 2-separated eNCE graph language that is not 3-separated. Apex eNCE graph grammars can be arbitrarily separated: every apex eNCE graph language can be generated by a k -separated apex eNCE grammar, for every k .

[1]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

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

[3]  Joost Engelfriet,et al.  A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars , 1990, Inf. Comput..

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

[5]  Seymour Ginsburg,et al.  Position-Restricted Grammar Forms and Grammars , 1982, Theor. Comput. Sci..

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

[7]  Bruno Courcelle An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..

[8]  Franz-Josef Brandenburg On Partially Ordered Graph Grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[9]  Joost Engelfriet,et al.  Linear Graph Grammars: Power and Complexity , 1989, Inf. Comput..

[10]  Robert W. Floyd,et al.  Syntactic Analysis and Operator Precedence , 1963, JACM.

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

[12]  Joost Engelfriet,et al.  Complexity of boundary graph languages , 1990, RAIRO Theor. Informatics Appl..

[13]  Joost Engelfriet,et al.  Boundary Graph Grammars with Dynamic Edge Relabeling , 1990, J. Comput. Syst. Sci..

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

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

[16]  Joost Engelfriet,et al.  Apex Graph Grammars , 1986, Graph-Grammars and Their Application to Computer Science.