Simple termination is difficult (Q1343111): Difference between revisions

@@ Property / cites work @@
+Q2736359
@@ Property / cites work: Q2736359 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulation of Turing machines by a regular rewrite rule
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized sufficient conditions for modular termination of rewriting
+Normal rank
@@ Property / cites work @@
+The undecidability of the Turing machine immortality problem
+Normal rank
@@ Property / cites work @@
+Q3327710
@@ Property / cites work: Q3327710 / rank @@
+Normal rank
@@ Property / cites work @@
+Modularity of simple termination of term rewriting systems with shared constructors
+Normal rank
@@ Property / cites work @@
+Q3998014
@@ Property / cites work: Q3998014 / rank @@
+Normal rank
@@ Property / cites work @@
+The undecidability of self-embedding for term rewriting systems
+Normal rank
@@ Property / cites work @@
+Q3774933
@@ Property / cites work: Q3774933 / rank @@
+Normal rank