COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA (Q3056281): Difference between revisions

@@ Property / cites work @@
+Finite complete rewriting systems and the complexity of word problem
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+A uniform method for proving lower bounds on the computational complexity of logical theories
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Pattern matching and membership for hierarchical message sequence charts
+Normal rank
@@ Property / cites work @@
+Q4843270
@@ Property / cites work: Q4843270 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for deciding bisimilarity of normed context-free processes
+Normal rank
@@ Property / cites work @@
+Knapsack problems for NL
@@ Property / cites work: Knapsack problems for NL / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the space complexity of some decision problems for finite automata
+Normal rank
@@ Property / cites work @@
+Word Problems and Membership Problems on Compressed Words
+Normal rank
@@ Property / cites work @@
+A PTIME-complete matching problem for SLP-compressed words
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of iterated shuffle
@@ Property / cites work: On the complexity of iterated shuffle / rank @@
+Normal rank
@@ Property / cites work @@
+A universal algorithm for sequential data compression
+Normal rank