Abstract
eNCE (edge label neighborhood controlled) graph grammars belong to the most powerful graph rewriting systems with single-node graphs on the left-hand side of the productions. From an algorithmic point of view, confluent and boundary eNCE graph grammars are the most interesting subclasses of eNCE graph grammars. In confluent eNCE graph grammars, the order in which nonterminal nodes are substituted is irrelevant for the resulting graph. In boundary eNCE graph grammars, nonterminal nodes are never adjacent. In this paper, we show that given a confluent or boundary eNCE graph grammar G, the problem whether the language L(G) defined by G is empty, is DEXPTIME-complete.
The work of the first author was supported by the German Research Association (DFG) grant Br-835-3/2
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F.J. Brandenburg. On partially ordered graph grammars. In [7], volume 291 of LNCS, pages 99–111, 1987.
A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 28:114–133, 1981.
V. Claus, H. Ehrig, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '78, volume 73 of LNCS. Springer-Verlag, 1979.
B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12–75, 1990.
B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences, 46:218–270, 1993.
H. Ehrig, H.J. Kreowski, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '90, volume 532 of LNCS. Springer-Verlag, 1991.
H. Ehrig, M. Nagl, A. Rosenfeld, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '86, volume 291 of LNCS. Springer-Verlag, 1987.
H. Ehrig, M. Nagl, and G. Rozenberg. Proceedings of Graph-Grammars and Their Application to Computer Science '82, volume 153 of LNCS. Springer-Verlag, 1983.
J. Engelfriet, G. Leih, and E. Welzl. Boundary graph grammars with dynamic edge relabeling. Journal of Computer and System Sciences, 40:307–345, 1990.
A. Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of LNCS. Springer-Verlag, 1992.
D. Janssens and G. Rozenberg. On the structure of node label controlled graph languages. Information Science, 20:191–216, 1980.
D. Janssens and G. Rozenberg. Restrictions, extensions, and variations of NLC grammars. Information Science, 20:217–244, 1980.
D. Janssens and G. Rozenberg. Graph grammars with neighbourhood-controlled embedding. Theoretical Computer Science, 21:55–74, 1982.
M. Kaul. Syntaxanalyse von Graphen bei Präzedenz-Graphgrammatiken. Dissertation, Universität Osnabrück, Osnabrück, Germany, 1985.
M. Kaul. Practical applications of precedence graph grammars. In [7], volume 291 of LNCS, pages 326–342, 1987.
T. Lengauer and E. Wanke. Efficient analysis of graph properties on context-free graph languages. Journal of the ACM, 40(2):368–393, 1993.
E. Wanke. Algorithms for graph problems on BNLC structured graphs. Information and Computation, 94(1):93–122, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skodinis, K., Wanke, E. (1995). Exponential time analysis of confluent and boundary eNCE graph languages. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59071-4_47
Download citation
DOI: https://doi.org/10.1007/3-540-59071-4_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59071-2
Online ISBN: 978-3-540-49183-5
eBook Packages: Springer Book Archive