Unique Normalization for Shallow TRS (Q3636819): 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.1007/978-3-642-02348-4_5
+Normal rank
@@ Property / OpenAlex ID @@
+W1527100187
@@ Property / OpenAlex ID: W1527100187 / rank @@
+Normal rank
@@ Property / cites work @@
+Term Rewriting and All That
@@ Property / cites work: Term Rewriting and All That / rank @@
+Normal rank
@@ Property / cites work @@
+Ground reducibility is EXPTIME-complete
@@ Property / cites work: Ground reducibility is EXPTIME-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidable properties of flat term rewrite systems
+Normal rank
@@ Property / cites work @@
+Termination of Rewriting with Right-Flat Rules
@@ Property / cites work: Termination of Rewriting with Right-Flat Rules / rank @@
+Normal rank
@@ Property / cites work @@
+On the Normalization and Unique Normalization Properties of Term Rewrite Systems
+Normal rank
@@ Property / cites work @@
+Automated Reasoning
@@ Property / cites work: Automated Reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability and confluence are undecidable for flat 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 @@
+Decidability for left-linear growing term rewriting systems.
+Normal rank
@@ Property / cites work @@
+Deterministic tree pushdown automata and monadic tree rewriting systems
+Normal rank
@@ Property / cites work @@
+Q3392275
@@ Property / cites work: Q3392275 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2723905
@@ Property / cites work: Q2723905 / rank @@
+Normal rank
@@ Property / cites work @@
+A new decidability technique for ground term rewriting systems with applications
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems
+Normal rank
@@ Property / cites work @@
+Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems
+Normal rank