Abstract
Edge grammars generate pairs of words which are interpreted as edges of graphs. We prove that it is undecidable whether or not all graphs generated by a linear edge grammar are connected Hamiltonian, Eulerian, planar, k-node-colourable, bipartite and trees, respectively. Moreover, for linear edge grammars, it is undecidable whether or not the generated set of graphs contains a connected or Hamiltonian or Eulerian graph.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Beauquier, An undecidable problem about rational sets and contour words of polyominoes. Inform. Process. Letters 37 (1991) 257–263.
F. Berman, Edge grammars and parallel computation. Proc. Allerton Conf. on Communication, Control, and Computing, 214–223, 1983.
F. Berman and G.E. Shannon, Representing graph families with edge grammars. Inform. Sci. 70 (1993) 241–269.
B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theor. Comp. Sci. 55 (1987) 141–181.
B. Courcelle, The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Inform. Comput. 85 (1990) 12–75.
J. Dassow, Decision problems for edge grammars. Otto-von-Guericke-University Magdeburg, Faculty of Computer Science, Techn. report 1/94.
J. Dassow and F. Hinz, Decision problems and regular chain code picture languages. Discrete Applied Math. 45 (1993) 29–49.
A. Habel, Hyperedge Replacements: Grammars and Languages. Lecture Notes in Computer Science 643, 1992.
A. Habel, H.-J. Kreowski and C. Lautemann, A comparison of compatible, finite and inductive graph properties. Theor. Comp. Sci. 110 (1993) 145–168.
A. Habel, H.-J. Kreowski and W. Vogler, Metatheorems for decision problems on hyperedge replacement graph languages. Acta Informatica 26 (1989) 657–677.
A. Habel, H.-J. Kreowski and W. Vogler, Decidable boundedness problems for sets of graphs generated by hyperedge replacement. Theor. Comp. Sci. 89 (1991) 33–62.
F. Harary, Graph Theory. Addison-Wesley Publ. Co., Reading, 1971
J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publ. Co., Reading, 1979.
D. Janssens and G. Rozenberg, Decision problems for node label controlled graph grammars. J. Comp. Syst. Sci. 22 (1981) 144–177.
D. Janssens and G. Rozenberg, Neighbourhood-uniform NLC grammars. Computer Vision, Graphics, and Image Processing 35 (1986) 131–151.
D. Janssens, G. Rozenberg and E. Welzl, The bounded degree problem for NLC grammars is decidable. J. Comp. Syst. Sci. 33 (1986) 415–422.
T. Lengauer and E. Wanke, Efficient analysis of graph properties on context-free graph languages. J. Assoc. Comp. Mach. 40 (1993) 368–393.
G. Rozenberg and E. Welzl, Graph theoretic closure properties of the family of boundary NLC graph languages. Acta Informatica 23 (1986) 289–309.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dassow, J. (1994). Decision problems for edge grammars. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_75
Download citation
DOI: https://doi.org/10.1007/3-540-58338-6_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58338-7
Online ISBN: 978-3-540-48663-3
eBook Packages: Springer Book Archive