New Undecidability Results for Properties of Term Rewrite Systems (Q5166638): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.entcs.2012.11.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2140520835
@@ Property / OpenAlex ID: W2140520835 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q113318030
@@ Property / Wikidata QID: Q113318030 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
+Normal rank
@@ Property / cites work @@
+Q2751361
@@ Property / cites work: Q2751361 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Normalization and Unique Normalization Properties of Term Rewrite Systems
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing confluence by rewrite closure and right ground term rewrite systems
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
+Normal rank
@@ Property / cites work @@
+The Confluence Problem for Flat TRSs
@@ Property / cites work: The Confluence Problem for Flat TRSs / rank @@
+Normal rank
@@ Property / cites work @@
+The reachability and related decision problems for monadic and semi-constructor TRSs
+Normal rank
@@ Property / cites work @@
+Universality of a reversible two-counter machine
@@ Property / cites work: Universality of a reversible two-counter machine / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability for left-linear growing term rewriting systems.
+Normal rank
@@ Property / cites work @@
+Computing in systems described by equations
@@ Property / cites work: Computing in systems described by equations / rank @@
+Normal rank
@@ Property / cites work @@
+The Church-Rosser property for ground term-rewriting systems is decidable
+Normal rank
@@ Property / cites work @@
+A new decidability technique for ground term rewriting systems with applications
+Normal rank
@@ Property / cites work @@
+Q2730723
@@ Property / cites work: Q2730723 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems
+Normal rank