Parameterized complexity of basic decision problems for tree automata (Q2855747): Difference between revisions

@@ Property / cites work @@
+Closure properties and decision problems of dag automata
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Chosen Problems for Finite Automata on Trees
+Normal rank
@@ Property / cites work @@
+Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
+Normal rank
@@ Property / cites work @@
+Tree Automata with Memory, Visibility and Structural Constraints
+Normal rank
@@ Property / cites work @@
+TREE AUTOMATA WITH GLOBAL CONSTRAINTS
@@ Property / cites work: TREE AUTOMATA WITH GLOBAL CONSTRAINTS / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Rigid Tree Automata
@@ Property / cites work: Rigid Tree Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q2778879
@@ Property / cites work: Q2778879 / rank @@
+Normal rank
@@ Property / cites work @@
+Abstracting cryptographic protocols with tree automata.
+Normal rank
@@ Property / cites work @@
+Automata for XML -- a survey
@@ Property / cites work: Automata for XML -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4544433
@@ Property / cites work: Q4544433 / rank @@
+Normal rank