The monadic second-order logic of graphs. VII: Graphs as relational structures
[Part VI is reviewed above.] The author defines operations on stuctures that are compatible with monadic second-order logic and that are powerful enough to represent context-free graph and hypergraph grammars of various types, namely, the so-called hyperedge replacement, C-edNCE, and separated handle rewriting grammars. Several results concerning monadic second-order properties of the generated sets are obtained in a uniform way.
scientific article; zbMATH DE number 64581
scientific article