Pumping, cleaning and symbolic constraints solving (Q4632446): Difference between revisions

@@ Property / cites work @@
+Equality and disequality constraints on direct subterms in tree automata
+Normal rank
@@ Property / cites work @@
+Encompassment properties and automata with constraints
+Normal rank
@@ Property / cites work @@
+Q4038726
@@ Property / cites work: Q4038726 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273671
@@ Property / cites work: Q4273671 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Narrowing based procedures for equational disunification
+Normal rank
@@ Property / cites work @@
+Automatic proofs by induction in theories without constructors
+Normal rank
@@ Property / cites work @@
+On sufficient-completeness and related properties of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Testing for the ground (co-)reducibility property in term-rewriting systems
+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 @@
+Q4282530
@@ Property / cites work: Q4282530 / rank @@
+Normal rank