Closure of Tree Automata Languages under Innermost Rewriting (Q5170159): Difference between revisions

@@ Property / cites work @@
+Q4260705
@@ Property / cites work: Q4260705 / rank @@
+Normal rank
@@ Property / cites work @@
+Equality and disequality constraints on direct subterms in tree automata
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Bottom-Up Rewriting Is Inverse Recognizability Preserving
+Normal rank
@@ Property / cites work @@
+Q4847003
@@ Property / cites work: Q4847003 / rank @@
+Normal rank
@@ Property / cites work @@
+Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow 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 @@
+Computer Science Logic
@@ Property / cites work: Computer Science Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Decidable approximations of term rewriting systems
+Normal rank
@@ Property / cites work @@
+Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow 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 @@
+Q4938609
@@ Property / cites work: Q4938609 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic tree pushdown automata and monadic tree rewriting systems
+Normal rank
@@ Property / cites work @@
+Q2723905
@@ Property / cites work: Q2723905 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree generating regular systems
@@ Property / cites work: Tree generating regular systems / rank @@
+Normal rank