Computing linearizations using test sets (Q5881192): Difference between revisions

@@ Property / cites work @@
+Computing ground reducibility and inductively complete positions
+Normal rank
@@ Property / cites work @@
+Reductions in tree replacement systems
@@ Property / cites work: Reductions in tree replacement systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3783519
@@ Property / cites work: Q3783519 / rank @@
+Normal rank
@@ Property / cites work @@
+On sufficient-completeness and related properties of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Q4027631
@@ Property / cites work: Q4027631 / rank @@
+Normal rank
@@ Property / cites work @@
+On relationship between term rewriting systems and regular tree languages
+Normal rank
@@ Property / cites work @@
+Explicit representation of terms defined by counter examples
+Normal rank
@@ Property / cites work @@
+Q3956381
@@ Property / cites work: Q3956381 / rank @@
+Normal rank
@@ Property / cites work @@
+Semantic confluence tests and completion methods
@@ Property / cites work: Semantic confluence tests and completion methods / rank @@
+Normal rank
@@ Property / cites work @@
+Q4431392
@@ Property / cites work: Q4431392 / rank @@
+Normal rank