No label defined (Q3785987)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4049098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4049098 |
Statements
1987
0 references
monadic second-order logic
0 references
decision problem
0 references
Context-free graph grammars
0 references
0.8800976872444153
0 references
0.8723149299621582
0 references
0.8467891812324524
0 references
[For the entire collection see Zbl 0636.00013.] The algebraic framework for studying graphs yields a notion of system of equations defining equational sets of graphs. Context-free graph grammars (where the rewriting step is the substitution a graph for an hyperedge) are defined. The context-free and the equational sets of graphs are the same. The monadic second-order theory of a context-free set of graphs is decidable.
0 references