Input-driven languages are in log n depth
Information Processing Letters
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
A uniform approach to define complexity classes
Theoretical Computer Science
Logspace and logtime leaf languages
Information and Computation
Succinct circuit representations and leaf language classes are basically the same concept
Information Processing Letters
Finite Monoids: From Word to Circuit Evaluation
SIAM Journal on Computing
Succinct representation, leaf languages, and projection reductions
Information and Computation
Nondeterministic NC1 computation
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Complexity of Language Recognition Problems for Compressed Words
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Input-Driven Languages are Recognized in log n Space
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
On the Complexities of Linear LL(1) and LR(1) Grammars
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
A PTIME-complete matching problem for SLP-compressed words
Information Processing Letters
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Word Problems and Membership Problems on Compressed Words
SIAM Journal on Computing
Querying and embedding compressed texts
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Compressedword problems for inverse monoids
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
Tight connections between leaf languages and strings compressed by straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a language L is complete for the leaf language class defined by L via logspace machines. A more difficult variant of the compressed membership problem for L is shown to be complete for the leaf language class defined by L via polynomial time machines. As a corollary, it is shown that there exists a fixed linear visibly pushdown language for which the compressed membership problem is PSPACE-complete. For XML languages, it is shown that the compressed membership problem is coNP-complete.Furthermore it is shown that the embedding problem for SLP-compressed strings is hard for PP (probabilistic polynomial time).