Recognizing edge replacement graph languages in cubic time
While in general the recognition problem for (hyper-)edge replacement grammars is NP-complete, there are polynomial algorithms for restricted graph classes. The degree of the corresponding polynomial depends on the size of the right hand sides of the grammar, and this size cannot be restricted without restricting the generative power.
In this paper we show that for the class of cyclically connected graphs the recognition problem for edge replacement grammars can be solved in cubic time, i.e. the degree of the polynomial does not depend on the size of the right hand sides of the grammar. For this result we give a suitable normal form for an edge replacement grammar. The algorithm uses the idea of the Cocke-Kasami-Younger algorithm and depends crucially on an algorithm of Hopcroft and Tarjan, which can be used to determine the form of a derivation tree for the given graph.
KeywordsEdge replacement parsing triconnected components
Unable to display preview. Download preview PDF.
- [Bra88]F.J. Brandenburg. On polynomial time graph grammars. In R. Cori et al., editors, STACS '88, Proc. of the 5th Annual Symposium on Theor. Aspects of Comp. Sci., Bordeaux, Lect. Notes Comp. Sci. 294, pages 227–236. Springer, 1988.Google Scholar
- [CER79]V. Claus, H. Ehrig, and G. Rozenberg, editors. Graph-Grammars and Their Application to Computer Science and Biology, Lect. Notes Comp. Sci. 73. Springer, 1979.Google Scholar
- [CW87]D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Proc. 19th ACM Symp. on Theory of Computing, New York City, pages 1–6, 1987.Google Scholar
- [ENR83]H. Ehrig, M. Nagl, and G. Rozenberg, editors. Graph Grammars and Their Application to Computer Science, Lect. Notes Comp. Sci. 153. Springer, 1983.Google Scholar
- [ENRR87]H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors. Graph-Grammars and Their Application to Computer Science, Lect. Notes Comp. Sci. 291. Springer, 1987.Google Scholar
- [Gin66]S. Ginsburg. The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York, 1966.Google Scholar
- [Hab89]A. Habel. Hyperedge replacement: Grammars and languages. Diss., FB Mathem. / Inform., Uni. Bremen, 1989.Google Scholar
- [HK87b]A. Habel and H.-J. Kreowski. Some structural aspects of hypergraph languages generated by hyperedge replacement. In F.J. Brandenburg et al., editors, STACS '87, Proc. of the 4th Annual Symposium on Theor. Aspects of Comp. Sci., Passau, Lect. Notes Comp. Sci. 247, pages 207–219. Springer, 1987.Google Scholar
- [HU79]J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.Google Scholar
- [Kre86]H.-J. Kreowski. Rule trees represent derivations in edge replacement systems. In G. Rozenberg and A. Salomaa, editors, The Book of L, pages 217–232. Springer, Berlin, 1986.Google Scholar
- [Lau88]C. Lautemann. Efficient algorithms on context-free languages. In T. Lepistö et al., editors, Automata, Languages and Programming Tampere, Lect. Notes Comp. Sci. 317, pages 362–378. Springer, 1988.Google Scholar
- [Vog90]W. Vogler. On hyperedge replacement and bnlc graph grammars. In M. Nagl, editor, Graph-Theoretic Concepts in Comp. Sci., Proc. 15th Int. Workshop WG '89, Castle Roduc, Lect. Notes Comp. Sci. 411, pages 78–93. Springer, 1990.Google Scholar