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

@@ Property / describes a project that uses @@
+TPDB
@@ Property / describes a project that uses: TPDB / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Timbuk
@@ Property / describes a project that uses: Timbuk / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Chaff
@@ Property / describes a project that uses: Chaff / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+AProVE
@@ Property / describes a project that uses: AProVE / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Tyrolean
@@ Property / describes a project that uses: Tyrolean / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CiME
@@ Property / describes a project that uses: CiME / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TORPA
@@ Property / describes a project that uses: TORPA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Matchbox
@@ Property / describes a project that uses: Matchbox / rank @@
+Normal rank
@@ 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.ic.2006.08.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2111433946
@@ Property / OpenAlex ID: W2111433946 / rank @@
+Normal rank
@@ 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