Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C78
@@ Property / Mathematics Subject Classification ID: 05C78 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C75
@@ Property / Mathematics Subject Classification ID: 05C75 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q99
@@ Property / Mathematics Subject Classification ID: 68Q99 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6639418
@@ Property / zbMATH DE Number: 6639418 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+automata
@@ Property / zbMATH Keywords: automata / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+recognizability
@@ Property / zbMATH Keywords: recognizability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+logic
@@ Property / zbMATH Keywords: logic / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+definability
@@ Property / zbMATH Keywords: definability / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+treewidth
@@ Property / zbMATH Keywords: treewidth / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+chordality
@@ Property / zbMATH Keywords: chordality / rank @@
+Normal rank

Revision as of 03:14, 28 June 2023