Completing a finite special string-rewriting system on the congruence class of the empty word (Q1191634): Difference between revisions

@@ Property / cites work @@
+Decidable sentences of Church-Rosser congruences
@@ Property / cites work: Decidable sentences of Church-Rosser congruences / rank @@
+Normal rank
@@ Property / cites work @@
+The Knuth-Bendix Completion Procedure and Thue Systems
+Normal rank
@@ Property / cites work @@
+Q4145882
@@ Property / cites work: Q4145882 / rank @@
+Normal rank
@@ Property / cites work @@
+About the descriptive power of certain classes of finite string-rewriting systems
+Normal rank
@@ Property / cites work @@
+Q4036570
@@ Property / cites work: Q4036570 / rank @@
+Normal rank
@@ Property / cites work @@
+It is undecidable whether a finite special string-rewriting system presents a group
+Normal rank
@@ Property / cites work @@
+On deciding the confluence of a finite string-rewriting system on a given congruence class
+Normal rank
@@ Property / cites work @@
+Decision problems for finite special string-rewriting systems that are confluent on some congruence class
+Normal rank
@@ Property / cites work @@
+Conjugacy in special monoids
@@ Property / cites work: Conjugacy in special monoids / rank @@
+Normal rank