Parameter Reduction in Grammar-Compressed Trees (Q3617731): Difference between revisions

@@ Property / cites work @@
+Tree Automata with Memory, Visibility and Structural Constraints
+Normal rank
@@ Property / cites work @@
+Tree transducers, L systems, and two-way machines
@@ Property / cites work: Tree transducers, L systems, and two-way machines / rank @@
+Normal rank
@@ Property / cites work @@
+Spinal-formed context-free tree grammars
@@ Property / cites work: Spinal-formed context-free tree grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Second-Order Unification Is NP-Complete
@@ Property / cites work: Bounded Second-Order Unification Is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of tree automata and XPath on grammar-compressed trees
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank