Abstract
In this paper, we demonstrate that the set of all hypergraphs of a hyperedge-replacement language that satisfy a so-called compatible property can again be generated by a hyperedge-replacement grammar. Because many familiar graph-theoretic properties like connectedness, k-colorability, planarity, the existence of Eulerian and Hamiltonian paths and cycles, etc. are compatible and compatibility is closed under Boolean operations, the members of a hyperedge-replacement language can be filtered through the sieve of various desirable and undesirable properties easily on the syntactic level of the generative grammar rules.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Courcelle: On Context-Free Sets of Graphs and Their Monadic Second-Order Theory, Lect. Not. Comp. Sci. 291, 133–146, 1987
B.Courcelle: The Monadic Second-Order Logic of Graphs I: Recognizable Sets of Finite Graphs, revised version of ”Recognizability and Second Order Definability for Sets of Finite Graphs” (Research Report 8634), Report 8837, Bordeaux I University, 1988
A. Habel: Graph-Theoretic Properties Compatible with Graph Derivations, Proc. Graph-Theoretic Concepts in Computer Science 1988 (WG'88), Lect. Not. Comp. Sci. 344, 11–29, 1989
A. Habel, H.-J. Kreowski: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement, Proc. STACS'87, Lect. Not. Comp. Sci. 247, 207–219, 1987
A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages, to appear in Acta Informatica, short version with the title ”Compatible Graph Properties are Decidable for Hyperedge Replacement Graph Languages” in: Bull. EATCS 33, 55–62, 1987
A. Habel, H.-J. Kreowski, W. Vogler: Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammars, Proc. Joint Conference on Theory and Practice of Software Development (TAPSOFT'89), Lect. Not. Comp. Sci. 351, 275–289, 1989
T. Lengauer, E. Wanke: Efficient Analysis of Graph Properties on Context-Free Graph Languages, Proc. ICALP'88, Lect. Not. Comp. Sci. 317, 379–393, 1988
J. Mezei, J. B. Wright: Algebraic Automata and Context-Free Sets, Information and Control 11, 3–29, 1967
G. Rozenberg, E. Welzl: Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages, Acta Informatica 23, 289–309, 1986
A. Salomaa: Formal Languages, Academic Press, New York, 1973
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Habel, A., Kreowski, HJ. (1990). Filtering hyperedge-replacement languages through compatible properties. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1989. Lecture Notes in Computer Science, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52292-1_8
Download citation
DOI: https://doi.org/10.1007/3-540-52292-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52292-8
Online ISBN: 978-3-540-46950-6
eBook Packages: Springer Book Archive