The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407): Difference between revisions

← Older edit Newer edit →

@@ Property / Recommended article @@
+The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
+Normal rank
+Similarity Score: 0.9800026Amount 0.9800026
Unit 1
-Amount
+.9800026
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Q3077955
@@ Property / Recommended article: Q3077955 / rank @@
+Normal rank
@@ Property / Recommended article: Q3077955 / qualifier @@
+Similarity Score: 0.95626473Amount 0.95626473
Unit 1
-Amount
+.95626473
 Unit
@@ Property / Recommended article: Q3077955 / qualifier @@
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
+Normal rank
+Similarity Score: 0.9445546Amount 0.9445546
Unit 1
-Amount
+.9445546
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
+Normal rank
+Similarity Score: 0.9429202Amount 0.9429202
Unit 1
-Amount
+.9429202
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Q4362731
@@ Property / Recommended article: Q4362731 / rank @@
+Normal rank
@@ Property / Recommended article: Q4362731 / qualifier @@
+Similarity Score: 0.9404117Amount 0.9404117
Unit 1
-Amount
+.9404117
 Unit
@@ Property / Recommended article: Q4362731 / qualifier @@
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
+Similarity Score: 0.9368054Amount 0.9368054
Unit 1
-Amount
+.9368054
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+The monadic second-order logic of graphs. IV: Definability properties of equational graphs
+Normal rank
+Similarity Score: 0.9360539Amount 0.9360539
Unit 1
-Amount
+.9360539
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
+Normal rank
+Similarity Score: 0.9346531Amount 0.9346531
Unit 1
-Amount
+.9346531
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
+Normal rank
+Similarity Score: 0.9336061Amount 0.9336061
Unit 1
-Amount
+.9336061
 Unit
+Recommender Run: Recommender Run 3
@@ Property / Recommended article @@
+Q2767003
@@ Property / Recommended article: Q2767003 / rank @@
+Normal rank
@@ Property / Recommended article: Q2767003 / qualifier @@
+Similarity Score: 0.9334834Amount 0.9334834
Unit 1
-Amount
+.9334834
 Unit
@@ Property / Recommended article: Q2767003 / qualifier @@
+Recommender Run: Recommender Run 3

Revision as of 12:02, 6 May 2025

scientific article

Language	Label	Description	Also known as
English	The monadic second-order logic of graphs. VII: Graphs as relational structures	scientific article

Statements

instance of

scholarly article

0 references

title

The monadic second-order logic of graphs. VII: Graphs as relational structures (English)

0 references

published in

Theoretical Computer Science

0 references

publication date

27 September 1992

0 references

review text

[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

reviewed by

Li Xiang

0 references

zbMATH Keywords

graph grammars

0 references

monadic second-order logic

0 references

hypergraph grammars

0 references

hyperedge replacement