Decidable call by need computations in term rewriting (extended abstract) (Q5234682): Difference between revisions

@@ Property / cites work @@
+Q4705604
@@ Property / cites work: Q4705604 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3979263
@@ Property / cites work: Q3979263 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
+Normal rank
@@ Property / cites work @@
+Q3702507
@@ Property / cites work: Q3702507 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree acceptors and some of their applications
@@ Property / cites work: Tree acceptors and some of their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q3323279
@@ Property / cites work: Q3323279 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidable approximations of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Sequentiality in orthogonal term rewriting systems
+Normal rank
@@ Property / cites work @@
+Q4705608
@@ Property / cites work: Q4705608 / rank @@
+Normal rank
@@ Property / cites work @@
+NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
+Normal rank
@@ Property / cites work @@
+Generalized finite automata theory with an application to a decision problem of second-order logic
+Normal rank
@@ Property / cites work @@
+Q4385530
@@ Property / cites work: Q4385530 / rank @@
+Normal rank