A taxonomy of problems with fast parallel algorithms
Information and Control
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Two applications of inductive counting for complementation problems
SIAM Journal on Computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection
Proceedings of the 7th Colloquium on Automata, Languages and Programming
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
An Improved Algorithm for the Membership Problem for Extended Regular Expressions
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Fast Algorithms for Extended Regular Expression Matching and Searching
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
LTL Path Checking Is Efficiently Parallelizable
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We show that the recognition problem of context-free languages can be reduced to membership in the language defined by a regular expression with intersection by a log space reduction with linear output length. We also show a matching upper bound improving the known fact that the membership problem for these regular expressions is in NC2. Together these results establish that the membership problem is complete in LOGCFL. For unary expressions we show hardness for the class NL and some related results.