Leaf languages and string compression (Q550251): Difference between revisions

@@ Property / DOI @@
-.1016/j.ic.2011.01.009
@@ Property / DOI: 10.1016/j.ic.2011.01.009 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W1997488434
@@ Property / OpenAlex ID: W1997488434 / rank @@
+Normal rank
@@ Property / cites work @@
+Visibly pushdown languages
@@ Property / cites work: Visibly pushdown languages / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Finite Monoids: From Word to Circuit Evaluation
@@ Property / cites work: Finite Monoids: From Word to Circuit Evaluation / rank @@
+Normal rank
@@ Property / cites work @@
+Formal properties of XML grammars and languages
@@ Property / cites work: Formal properties of XML grammars and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4846257
@@ Property / cites work: Q4846257 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct circuit representations and leaf language classes are basically the same concept
+Normal rank
@@ Property / cites work @@
+A uniform approach to define complexity classes
@@ Property / cites work: A uniform approach to define complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic \(NC^1\) computation
@@ Property / cites work: Nondeterministic \(NC^1\) computation / rank @@
+Normal rank
@@ Property / cites work @@
+The Smallest Grammar Problem
@@ Property / cites work: The Smallest Grammar Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for Lempel-Ziv encoding
@@ Property / cites work: Efficient algorithms for Lempel-Ziv encoding / rank @@
+Normal rank
@@ Property / cites work @@
+The Hardest Context-Free Language
@@ Property / cites work: The Hardest Context-Free Language / rank @@
+Normal rank
@@ Property / cites work @@
+Q4408477
@@ Property / cites work: Q4408477 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4364598
@@ Property / cites work: Q4364598 / rank @@
+Normal rank
@@ Property / cites work @@
+On balanced versus unbalanced computation trees
@@ Property / cites work: On balanced versus unbalanced computation trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4284250
@@ Property / cites work: Q4284250 / rank @@
+Normal rank
@@ Property / cites work @@
+Logspace and logtime leaf languages
@@ Property / cites work: Logspace and logtime leaf languages / rank @@
+Normal rank
@@ Property / cites work @@
+The iterated mod problem
@@ Property / cites work: The iterated mod problem / rank @@
+Normal rank
@@ Property / cites work @@
+On Second-Order Monadic Monoidal and Groupoidal Quantifiers
+Normal rank
@@ Property / cites work @@
+Processing Compressed Texts: A Tractability Border
+Normal rank
@@ Property / cites work @@
+Querying and Embedding Compressed Texts
@@ Property / cites work: Querying and Embedding Compressed Texts / rank @@
+Normal rank
@@ Property / cites work @@
+Word Problems and Membership Problems on Compressed Words
+Normal rank
@@ Property / cites work @@
+Leaf languages and string compression
@@ Property / cites work: Leaf languages and string compression / rank @@
+Normal rank
@@ Property / cites work @@
+COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA
+Normal rank
@@ Property / cites work @@
+A PTIME-complete matching problem for SLP-compressed words
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2752466
@@ Property / cites work: Q2752466 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941166
@@ Property / cites work: Q4941166 / rank @@
+Normal rank
@@ Property / cites work @@
+Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
+Normal rank
@@ Property / cites work @@
+PP is as Hard as the Polynomial-Time Hierarchy
@@ Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representation, leaf languages, and projection reductions
+Normal rank
@@ Property / cites work @@
+RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
+Normal rank
@@ Property / cites work @@
+Q3341935
@@ Property / cites work: Q3341935 / rank @@
+Normal rank
@@ Property / cites work @@
+A universal algorithm for sequential data compression
+Normal rank
@@ Property / DOI @@
+.1016/J.IC.2011.01.009
@@ Property / DOI: 10.1016/J.IC.2011.01.009 / rank @@
+Normal rank