A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831): Difference between revisions

@@ Property / cites work @@
+An algebraic theory of graph reduction
@@ Property / cites work: An algebraic theory of graph reduction / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence of pre-NTS grammars is decidable
@@ Property / cites work: The equivalence of pre-NTS grammars is decidable / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385528
@@ Property / cites work: Q4385528 / rank @@
+Normal rank
@@ Property / cites work @@
+NTS languages are deterministic and congruential
@@ Property / cites work: NTS languages are deterministic and congruential / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic Thue systems
@@ Property / cites work: Monadic Thue systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4846257
@@ Property / cites work: Q4846257 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4176990
@@ Property / cites work: Q4176990 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5181346
@@ Property / cites work: Q5181346 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992832
@@ Property / cites work: Q3992832 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3880295
@@ Property / cites work: Q3880295 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors
+Normal rank
@@ Property / cites work @@
+Finite-Turn Pushdown Automata
@@ Property / cites work: Finite-Turn Pushdown Automata / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence problem of multitape finite automata
+Normal rank
@@ Property / cites work @@
+Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
+Normal rank
@@ Property / cites work @@
+Q4036570
@@ Property / cites work: Q4036570 / rank @@
+Normal rank
@@ Property / cites work @@
+On weakly confluent monadic string-rewriting systems
+Normal rank
@@ Property / cites work @@
+It is decidable whether a monadic thue system is canonical over a regular set
+Normal rank
@@ Property / cites work @@
+Infinite regular Thue systems
@@ Property / cites work: Infinite regular Thue 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 problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems
+Normal rank
@@ Property / cites work @@
+Q3965569
@@ Property / cites work: Q3965569 / rank @@
+Normal rank
@@ Property / cites work @@
+The equivalence and inclusion problems for NTS languages
+Normal rank
@@ Property / cites work @@
+Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
+Normal rank
@@ Property / cites work @@
+A characterisation of deterministic context-free languages by means of right-congruences
+Normal rank
@@ Property / cites work @@
+Some decision problems about controlled rewriting systems
+Normal rank