On tree automata that certify termination of left-linear term rewriting systems (Q876043): Difference between revisions

@@ Property / cites work @@
+The lambda calculus. Its syntax and semantics. Rev. ed.
+Normal rank
@@ Property / cites work @@
+Q3917482
@@ Property / cites work: Q3917482 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability analysis over term rewriting systems
@@ Property / cites work: Reachability analysis over term rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4179852
@@ Property / cites work: Q4179852 / rank @@
+Normal rank
@@ Property / cites work @@
+Match-bounded string rewriting systems
@@ Property / cites work: Match-bounded string rewriting systems / rank @@
+Normal rank
@@ Property / cites work @@
+Term Rewriting and Applications
@@ Property / cites work: Term Rewriting and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
+Normal rank
@@ Property / cites work @@
+Term Rewriting and Applications
@@ Property / cites work: Term Rewriting and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Deleting string rewriting systems preserve regularity
+Normal rank
@@ Property / cites work @@
+Q2843601
@@ Property / cites work: Q2843601 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability for left-linear growing term rewriting systems.
+Normal rank
@@ Property / cites work @@
+Q4799892
@@ Property / cites work: Q4799892 / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of context-sensitive rewriting
@@ Property / cites work: Termination of context-sensitive rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of string rewriting proved automatically
+Normal rank