A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems (Q613611): 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/s00200-010-0133-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2006460851
@@ Property / OpenAlex ID: W2006460851 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequentiality, monadic second-order logic and tree automata.
+Normal rank
@@ Property / cites work @@
+Unique Normalization for Shallow TRS
@@ Property / cites work: Unique Normalization for Shallow TRS / rank @@
+Normal rank
@@ Property / cites work @@
+Automated Deduction – CADE-20
@@ Property / cites work: Automated Deduction – CADE-20 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding confluence of certain term rewriting systems in polynomial time
+Normal rank
@@ Property / cites work @@
+Decidability and complexity analysis by basic paramodulation
+Normal rank
@@ Property / cites work @@
+Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems
+Normal rank
@@ Property / cites work @@
+Q2730723
@@ Property / cites work: Q2730723 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:613611