It is decidable whether a monadic thue system is canonical over a regular set (Q3210188): Difference between revisions

@@ Property / cites work @@
+An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
+Normal rank
@@ Property / cites work @@
+Q5616207
@@ Property / cites work: Q5616207 / rank @@
+Normal rank
@@ Property / cites work @@
+Thue systems as rewriting systems
@@ Property / cites work: Thue systems as rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the Church-Rosser property
@@ Property / cites work: Testing for the Church-Rosser property / rank @@
+Normal rank
@@ Property / cites work @@
+On Proving Uniform Termination and Restricted Termination of Rewriting Systems
+Normal rank
@@ Property / cites work @@
+On ground-confluence of term rewriting systems
@@ Property / cites work: On ground-confluence of term rewriting systems / rank @@
+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 @@
+The equivalence and inclusion problems for NTS languages
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic finite-turn pushdown automata
+Normal rank