Power Properties of NLC Graph Grammars with a Polynomial Membership Problem

A research into syntax analysis of node label controlled (NLC) graph grammars (introduced and investigated in Janssens and Rozenberg (1980) and Janssens et al. (1982) has resulted in defining their subclasses with a polynomial membership problem (Flasinski, 1988, 1989, 1993). Good complexity properties have been shown in the last referred paper by defining an efficient parsing algorithm, O(n2), for the so-called ETPL(k) subclass of NLC grammars. In this paper we investigate power properties of this parsable subclass. The paper contains also a short bibliographical survey and a discussion concerning a problem of constructing graph languages with a polynomial membership problem.

[1]  Mariusz Flasinski.  On the parsing of deterministic graph languages for syntactic pattern recognition , 1993, Pattern Recognit..

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

[3]  Daniel J. Rosenkrantz,et al.  Properties of deterministic top down grammars , 1969, STOC.

[4]  Daniel J. Rosenkrantz,et al.  Properties of Deterministic Top-Down Grammars , 1970, Inf. Control..

[5]  Richard Edwin Stearns,et al.  Syntax-Directed Transduction , 1966, JACM.

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

[7]  Terrence W. Pratt,et al.  Pair Grammars, Graph Languages and String-to-Graph Translations , 1971, J. Comput. Syst. Sci..

[8]  Mariusz Flasinski.  Use of graph grammars for the description of mechanical parts , 1995, Comput. Aided Des..

[9]  Manfred Kaul.  Parsing of graphs in linear time , 1982, Graph-Grammars and Their Application to Computer Science.

[10]  Ugo Montanari,et al.  Separable Graphs, Planar Graphs and Web Grammars , 1970, Inf. Control..

[11]  Jerome Feder,et al.  Plex languages , 1971, Inf. Sci..

[12]  Mariusz Flasiński.  Characteristics of edNLC-graph grammar for syntactic pattern recognition , 1989, Comput. Vis. Graph. Image Process..

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

[14]  Emo Welzl,et al.  Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars , 1984, ICALP.

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

[16]  Katsushi Inoue,et al.  Cyclic closure properties of automata on a two-dimensional tape , 1978, Inf. Sci..

[17]  György Turán,et al.  On the complexity of graph grammars , 1983, Acta Cybernetica.

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

[19]  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.

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

[21]  Joost Engelfriet,et al.  Restricting the complexity of regular DNLC languages , 1986, Graph-Grammars and Their Application to Computer Science.

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

[23]  Mariusz Flasiński.  Parsing of edNLC-graph grammars for scene analysis , 1988, Pattern Recognit..

[24]  Leszek Kotulski,et al.  On the Use of Graph Grammers for the Control of a Distributed Software Allocation , 1992, Comput. J..

[25]  Azriel Rosenfeld,et al.  Web Grammars , 1969, IJCAI.

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

[27]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

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

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

[30]  Annegret Habel,et al.  May we introduce to you: hyperedge replacement , 1986, Graph-Grammars and Their Application to Computer Science.

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

[32]  Carlo Ghezzi,et al.  Context-Free Graph Grammars , 1978, Inf. Control..

[33]  Horst Bunke,et al.  A Parser for Context Free Plex Grammars , 1989, WG.

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

[35]  Curtis R. Cook,et al.  First Order Graph Grammars , 1974, SIAM J. Comput..

[36]  Mariusz Flasinski.  Distorted pattern analysis with the help of node label controlled graph languages , 1990, Pattern Recognit..

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

[38]  Joost Engelfriet,et al.  Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[39]  King-Sun Fu,et al.  Syntactic Pattern Recognition And Applications , 1968 .

[40]  Janice Jeffs.  Embedding Rule Independent Theory of Graph Grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[41]  Tsuyoshi Yamamoto,et al.  A new parsing scheme for plex grammars , 1990, Pattern Recognit..