Test sets for the universal and existential closure of regular tree languages. (Q1400712): Difference between revisions

@@ Property / cites work @@
+Un théorème de duplication pour les forets algébriques
+Normal rank
@@ Property / cites work @@
+Q4039803
@@ Property / cites work: Q4039803 / rank @@
+Normal rank
@@ Property / cites work @@
+Automated theorem proving by test set induction
@@ Property / cites work: Automated theorem proving by test set induction / rank @@
+Normal rank
@@ Property / cites work @@
+Automated Mathematical Induction
@@ Property / cites work: Automated Mathematical Induction / rank @@
+Normal rank
@@ Property / cites work @@
+Tree generating regular systems
@@ Property / cites work: Tree generating regular systems / rank @@
+Normal rank
@@ Property / cites work @@
+Ground reducibility is EXPTIME-complete
@@ Property / cites work: Ground reducibility is EXPTIME-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Automata for reduction properties solving
@@ Property / cites work: Automata for reduction properties solving / rank @@
+Normal rank
@@ Property / cites work @@
+Q5633929
@@ Property / cites work: Q5633929 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3323279
@@ Property / cites work: Q3323279 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4847003
@@ Property / cites work: Q4847003 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4200260
@@ Property / cites work: Q4200260 / rank @@
+Normal rank
@@ Property / cites work @@
+Linearizing term rewriting systems using test sets
+Normal rank
@@ Property / cites work @@
+Q4938607
@@ Property / cites work: Q4938607 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4954448
@@ Property / cites work: Q4954448 / rank @@
+Normal rank
@@ Property / cites work @@
+Proofs by induction in equational theories with constructors
+Normal rank
@@ Property / cites work @@
+Automatic proofs by induction in theories without constructors
+Normal rank
@@ Property / cites work @@
+Sufficient-completeness, ground-reducibility and their complexity
+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 @@
+Automating inductionless induction using test sets
+Normal rank
@@ Property / cites work @@
+Testing for the ground (co-)reducibility property in term-rewriting systems
+Normal rank
@@ Property / cites work @@
+Q4712663
@@ Property / cites work: Q4712663 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of regularity and related properties of ground normal form languages
+Normal rank
@@ Property / cites work @@
+Q3853827
@@ Property / cites work: Q3853827 / rank @@
+Normal rank
@@ Property / cites work @@
+Deduction and Declarative Programming
@@ Property / cites work: Deduction and Declarative Programming / 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 @@
+Q3142025
@@ Property / cites work: Q3142025 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221429
@@ Property / cites work: Q3221429 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4431392
@@ Property / cites work: Q4431392 / rank @@
+Normal rank