论文信息 - On labelled graph grammars

On labelled graph grammars

abstractAccording to the classification of labelled graph grammars by Nagl [4], it can be shown that the class of context-sensitive graph languages is equivalent to the class of context-free graph languages and the context-free graph languages properly include the regular graph languages.ZusammenfassungMit der Klassifikation der Markierten Graph-Grammatiken von Nagl [4] kann man zeigen, daß die Klasse der Kontext-sensitiven Graph-Sprachen gleich ist wie die Klasse von Kontext-freien Graph-Sprachen, und daß die Kontext-freien Graph-Sprachen eigentlich die regulären Graph-Sprachen enthalten.

Leon S. Levy | Kang Yueh

[1] Barry K. Rosen,et al. Deriving graphs from graphs by applying a production , 1975, Acta Informatica.

[2] Manfred Nagl. Formal languages of labelled graphs , 2005, Computing.

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

[4] Hartmut Ehrig,et al. Grammars on partial graphs , 2004, Acta Informatica.

[5] Manfred Nagl,et al. Graph Rewriting Systems and their Application in Biology , 1976 .

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

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

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

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