Linear Graph Grammars: Power and Complexity

Abstract A graph grammar is linear if it generates graphs with at most one nonterminal node. Linear graph grammars can simulate nonterminal bounded graph grammars (which generate graphs with a bounded number of nonterminal nodes) and derivation bounded graph grammars. If a linear graph language contains connected graphs of bounded degree only, then it is in NSPACE(log n ). These results are shown for graph grammars with neighbourhood controlled embedding and with dynamic edge relabeling (eNCE grammars).

[1]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

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

[3]  Grzegorz Rozenberg,et al.  Hypergraph Systems and Their Extensions , 1983, RAIRO Theor. Informatics Appl..

[4]  Fillia Makedon,et al.  Topological Bandwidth , 1983, CAAP.

[5]  Efficient algorithms on context-free graph languages , .

[6]  Grzegorz Rozenberg,et al.  On sequential and parallel node-rewriting graph grammars , 1982, Comput. Graph. Image Process..

[7]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

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

[10]  Seymour Ginsburg,et al.  Derivation-Bounded Languages , 1968, J. Comput. Syst. Sci..

[11]  Manfred Kaul,et al.  Syntaxanalyse von Graphen bei Präsidenz-Graph-Grammatiken , 1986 .

[12]  S. Ginsburg,et al.  Finite-Turn Pushdown Automata , 1966 .

[13]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[14]  Joost Engelfriet,et al.  The Complexity of Regular DNLC Graph Languages , 1990, J. Comput. Syst. Sci..

[15]  Eitan M. Gurari,et al.  Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem , 1984, J. Algorithms.

[16]  Joost Engelfriet,et al.  Nonterminal Bounded NLC Graph Grammars , 1988, Theor. Comput. Sci..

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

[18]  Thomas Lengauer.  Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees , 1982 .

[19]  Azriel Rosenfeld,et al.  Graph Grammars and Their Application to Computer Science , 1990, Lecture Notes in Computer Science.

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

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

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

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

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

[25]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[26]  Theodosios Pavlidis,et al.  Linear and Context-Free Graph Grammars , 1972, JACM.

[27]  Grzegorz Rozenberg,et al.  Graph grammars with node-label controlled rewriting and embedding , 1982, Graph-Grammars and Their Application to Computer Science.