Skip to main content
SpringerLink
Log in

The complexity of graph languages generated by hyperedge replacement

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Although in many ways, hyperedge replacement graph grammars (HRGs) are, among all graph generating mechanisms, what context-free Chomsky grammars are in the realm of string rewriting, their parsing problem is known to be, in general, NP-complete. In this paper, the main difficulty in HRG parsing is analysed and some conditions on either grammar or input graphs are developed under which parsing can be done in polynomial time. For some of the cases, the parsing problem is shown to be log-space reducible to context-free string parsing.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Discrete Meth. 8, 277–284 (1987)

    Google Scholar 

  2. Bauderon, M., Courcelle, B.: Graph Expressions and graph rewriting. Math. Syst. Theory 20, 83–127 (1987)

    Google Scholar 

  3. Bodlaender, H.: NC-algorithms for graphs with small treewidth. Report RUU-CS-88-4, Rijksuniversiteit Utrecht, vakgroep informatica, 1988

  4. Brandenburg, F.-J.: On partially ordered graph grammars. Lect. Notes Comput. Sci. 291, 99–111 (1987)

    Google Scholar 

  5. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28, 114–133 (1981)

    Google Scholar 

  6. Claus, V., Ehrig, H., Rozenberg, G. (eds.): Graph grammars and their application to Computer Science and Biology. Lect. Notes Comput. Sci. 73 (1979)

  7. Cook, S.A.: Towards a complexity theory of synchronous parallel computation. L'Enseignement Math. 27, 99–124 (1981)

    Google Scholar 

  8. Courcelle, B.: An axiomatic definition of context-free rewriting and its application to NLC graph grammars. TCS 55, 141–181 (1987)

    Google Scholar 

  9. Della Vigna, P., Ghezzi, C.: Context-free graph grammars. Inf. Control 37, 207–233 (1978)

    Google Scholar 

  10. Ehrig, H., Nagl, M., Rozenberg, G. (eds.): Graph grammars and their application to Computer Science. (Lect. Notes Comput. Sci., vol. 153). Berlin Heidelberg New York: Springer 1983

    Google Scholar 

  11. Engelfriet, J. (personal communication)

  12. Engelfriet, J., Leih, G.: Complexity of boundary graph languages. Report 88-07, Leiden 1988

  13. Engelfriet, J., Rozenberg, G.: A comparison of boundary graph grammars, and context-free hypergraph grammars. Report 88-06, Leiden 1988

  14. Feder, J.: Plex languages. Inf. Sci. 3, 225–241 (1971)

    Google Scholar 

  15. Franck, R.: A class of linearly parsable graph grammars. Acta Inf. 10, 175–201 (1978)

    Google Scholar 

  16. Habel, A.: Hyperedge replacement: Grammars and languages. Dissertation, Bremen 1989

  17. Habel, A., Kreowski, H.-J.: Some structural aspects of hypergraph languages generated by hyperedge replacement. Lect. Notes Comput. Sci. 247, 207–219 (1987)

    Google Scholar 

  18. Habel, A., Kreowski, H.-J., Vogler, W.: Decidable boundedness problems for hyperedge-replacement graph grammars. Lect. Notes Comput. Sci. 351, 275–289 (1989)

    Google Scholar 

  19. Hromkovič, J.: Two independent solutions of the 23-years old open problem in one year. EATCS Bull. 34, 310–313 (1988)

    Google Scholar 

  20. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Reading, Mass.: Addison-Wesley 1979

    Google Scholar 

  21. Immerman, N.: Nondeterministic space is closed under complement. TR 552, Yale University, July 1987, also in: Proc. 3rd Ann. Conf. on Structure in Complexity Theory, 1988, revised in SIAM J. Comput. 17, 935–938 (1988)

  22. Kaul, M.: Practical applications of precedence graph grammars. Lect. Notes Comput. Sci. 291, 326–342 (1987)

    Google Scholar 

  23. Lange, K.-J., Welzl, E.: String grammars with disconnection. Discrete Appl. Math. 16, 17–30 (1987)

    Google Scholar 

  24. Lautemann, C.: Decomposition trees: structured graph representation and efficient algorithms. Lect. Notes Comput. Sci. 299, 28–39 (1988)

    Google Scholar 

  25. Lautemann, C.: Efficient algorithms on context-free graph languages. Lect. Notes Comput. Sci. 317, 362–378 (1988)

    Google Scholar 

  26. Leung, J.Y.-T., Witthof, J., Vornberger, O.: On some variations of the bandwidth minimization problem. SIAM J. Comput. 13, 650–667 (1984)

    Google Scholar 

  27. Pavlidis, T.: Linear and context-free graph grammars. J. ACM 19, 11–22 (1972)

    Google Scholar 

  28. Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of treewidth. J. Algorithms 7, 309–322 (1986)

    Google Scholar 

  29. Rozenberg, G., Welzl, E.: Boundary NLC grammars — basic definitions, normal forms and complexity. Inf. Control 69, 136–167 (1986)

    Google Scholar 

  30. Ruzzo, W.L.: Tree-size bounded alternation. J. Comput. Syst. Sci. 20, 218–235 (1980)

    Google Scholar 

  31. Schuster, R.: Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität. Dissertation, Passau 1987

  32. Slisenko, A.O.: Context-free graph grammars as a tool for describing polynomial-time subclasses of hard problems. Inf. Proc. Lett. 14, 52–56 (1982)

    Google Scholar 

  33. Sudborough, I.H.: On the tape complexity of deterministic context-free languages. J. ACM 25, 405–414 (1978)

    Google Scholar 

  34. Szelepcsényi, R.: The method of forcing for nondeterministic automata. EATCS Bull. 33, 96–99 (1987) (revised in Acta Inf. 26, 279–284 (1988))

    Google Scholar 

  35. Venkateswaran, H.: Properties that characterize LOGCFL. Proc. 19th ACM-STOC, pp. 141–150, 1987

  36. Vogler, W.: A note on hyperedge replacement and BNLC graph grammars. Preprint, München 1988

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Johannes Gutenberg-Universität, Saarstrasse 21, D-6500, Mainz, Federal Republic of Germany

    Clemens Lautemann

Authors
  1. Clemens Lautemann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lautemann, C. The complexity of graph languages generated by hyperedge replacement. Acta Informatica 27, 399–421 (1990). https://doi.org/10.1007/BF00289017

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289017

Keywords

Search

Navigation