The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The monadic second-order logic of graphs. VII: Graphs as relational structures |
scientific article; zbMATH DE number 64581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The monadic second-order logic of graphs. VII: Graphs as relational structures |
scientific article; zbMATH DE number 64581 |
Statements
The monadic second-order logic of graphs. VII: Graphs as relational structures (English)
0 references
27 September 1992
0 references
[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.
0 references
graph grammars
0 references
monadic second-order logic
0 references
hypergraph grammars
0 references
hyperedge replacement
0 references
separated handle rewriting
0 references
0 references
0 references
0 references
0.9800026
0 references
0.9445546
0 references
0.9429202
0 references
0.9368054
0 references
0.9360539
0 references
0.9346531
0 references
0.9336061
0 references
