论文信息 - Context-Free Graph Grammars - 字舞流文

Context-Free Graph Grammars

In this paper we develop a theory of context-free graph grammars. Formal properties of such grammars are proven, with particular attention to graph language recognizability.

Carlo Ghezzi | Pierluigi Della Vigna | C. Ghezzi | P. D. Vigna

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

[2] Norihiro Abe,et al. Web Grammars and Several Graphs , 1973, J. Comput. Syst. Sci..

[3] J. Mylopoulos,et al. Using Graph Grammars To Define Sets Of Digraphs , 1979 .

[4] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .

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

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

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

[8] Carlo Ghezzi,et al. Data Structures and Graph Grammars , 1976, ECI.