1. B. Courcelle: On Context-Free Sets of Graphs and Their Monadic Second-Order Theory, Lect. Not. Comp. Sci. 291, 133–146, 1987
2. 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
3. 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
4. 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
5. 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