Equality and disequality constraints on direct subterms in tree automata (Q5096779): Difference between revisions

@@ Property / cites work @@
+Equational formulae with membership constraints
@@ Property / cites work: Equational formulae with membership constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993363
@@ Property / cites work: Q3993363 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3323279
@@ Property / cites work: Q3323279 / 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 @@
+The Church-Rosser property for ground term-rewriting systems is decidable
+Normal rank
@@ Property / cites work @@
+Computational aspects of an order-sorted logic with term declarations
+Normal rank