Restricting the complexity of regular DNLC languages
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 wordsNLC graph grammars NP-complete NLOG componentbounded degree-bounded linear ordering
Unable to display preview. Download preview PDF.
- [AE]Aalbersberg, IJ.J. and Engelfriet, J., The recognition of trace languages, Techn. Rep. 86-18, University of Leiden, 1986.Google Scholar
- [AR2]Aalbersberg, IJ.J. and Rozenberg, G., Theory of Traces, Techn. Rep. 86-16, University of Leiden, 1986.Google Scholar
- [C]Cook, S.A., Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, Journal of the Association for Computing Machinery 18 (1971) 4–18.Google Scholar
- [GJ]Garey, M.R. and Johnson, D.S., Computers and Intractability — a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.Google Scholar
- [H]Harary, F., Graph Theory, Addison-Wesley, Reading, Mass., 1969.Google Scholar
- [HU]Hopcroft, J.E. and Ullman, J.D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.Google Scholar
- [Ma]Mazurkiewicz, A., Concurrent Program Schemes and their Interpretations, DAIMI Rept. PB — 78, Aarhus University, 1977.Google Scholar
- [R]Reisig, W., Petri Nets, an Introduction, Springer, Berlin, 1985.Google Scholar
- [S]Salomaa, A., Formal Languages, Academic Press, New York, 1973.Google Scholar