Part II Technical Contributions

Graph-Grammars and Their Application to Computer Science

Volume 291 of the series Lecture Notes in Computer Science pp 147-166

Date:

Restricting the complexity of regular DNLC languages

  • IJsbrand Jan AlbersbergAffiliated withDepartment of Computer Science, University of Leiden
  • , Joost EngelfrietAffiliated withDepartment of Computer Science, University of Leiden
  • , Grzegorz RozenbergAffiliated withDepartment of Computer Science, University of Leiden

* Final gross prices may vary according to local VAT.

Get Access

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