Some subclasses of context-free languages in NC1
Information Processing Letters
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Randomized algorithms
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Data streams: algorithms and applications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Complexities of Linear LL(1) and LR(1) Grammars
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Inferring Deterministic Linear Languages
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Journal of the ACM (JACM)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Communication Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Left-derivation bounded languages
Journal of Computer and System Sciences
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing
Streaming algorithms for some problems in log-space
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
| Hi-index | 5.23 |
We study the complexity of the following problems in the streaming model. Membership testing forDLIN. We show that every language in DLIN can be recognized by a randomized one-pass O(logn) space algorithm with an inverse polynomial one-sided error and by a deterministic p-pass O(n/p) space algorithm. We show that these algorithms are optimal. Membership testing forLL(k). For languages generated by LL(k) grammars with a bound of r on the number of nonterminals at any stage in the left-most derivation, we show that membership can be tested by a randomized one-pass O(rlogn) space algorithm with an inverse polynomial (in n) one-sided error. Membership testing forDCFL. We show that randomized algorithms as efficient as the ones described above for DLIN and LL(k) (which are subclasses of DCFL) cannot exist for all of DCFL: there is a language in VPL (a subclass of DCFL) for which any randomized p-pass algorithm with an error bounded by @e