Restricting the complexity of regular DNLC languages

  • IJsbrand Jan Albersberg
  • Joost Engelfriet
  • Grzegorz Rozenberg
Part II Technical Contributions

DOI: 10.1007/3-540-18771-5_51

Part of the Lecture Notes in Computer Science book series (LNCS, volume 291)
Cite this paper as:
Albersberg I.J., Engelfriet J., Rozenberg G. (1987) Restricting the complexity of regular DNLC languages. In: Ehrig H., Nagl M., Rozenberg G., Rosenfeld A. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1986. Lecture Notes in Computer Science, vol 291. Springer, Berlin, Heidelberg

Abstract

Regular directed node-label controlled graph grammars (RDNLC grammars) originated from the need for a formal description of event structure languages (related to Petri nets) and of dependence graph languages (related to trace languages). In this framework complexity problems concerning event structure languages and dependence graph languages can be reduced to complexity problems concerning RDNLC languages.

It is known that the membership problem for RDNLC languages is NP-complete. This paper describes borderlines between NP-complete and less complex RDNLC languages. Moreover, for some of those less complex cases, the corresponding techniques for deciding the membership problem are provided.

Key words

NLC graph grammars NP-complete NLOG componentbounded degree-bounded linear ordering 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • IJsbrand Jan Albersberg
    • 1
  • Joost Engelfriet
    • 1
  • Grzegorz Rozenberg
    • 1
  1. 1.Department of Computer ScienceUniversity of LeidenLeidenThe Netherlands
  2. 2.Philips Research LaboratoriesEindhovenThe Netherlands

Personalised recommendations