A finiteness condition for rewriting systems (Q1331943): Difference between revisions

@@ Property / cites work @@
+Finite complete rewriting systems and the complexity of word problem
+Normal rank
@@ Property / cites work @@
+Q4846257
@@ Property / cites work: Q4846257 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite derivation type implies the homological finiteness condition \(FP_ 3\)
+Normal rank
@@ Property / cites work @@
+Complete rewriting systems and homology of monoid algebras
+Normal rank
@@ Property / cites work @@
+About the descriptive power of certain classes of finite string-rewriting systems
+Normal rank
@@ Property / cites work @@
+Q4135772
@@ Property / cites work: Q4135772 / rank @@
+Normal rank
@@ Property / cites work @@
+Word problems and a homological finiteness condition for monoids
+Normal rank
@@ Property / cites work @@
+Q3026992
@@ Property / cites work: Q3026992 / rank @@
+Normal rank
@@ Property / cites work @@
+A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
+Normal rank