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
A polynomial-time parsing algorithm for K-depth languages
Journal of Computer and System Sciences
Non-commutative arithmetic circuits: depth reduction and size lower bounds
Theoretical Computer Science
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Pebbling Moutain Ranges and its Application of DCFL-Recognition
Proceedings of the 7th Colloquium on Automata, Languages and Programming
On the Complexities of Linear LL(1) and LR(1) Grammars
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Robust Class of Context-Sensitive Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
DLT'07 Proceedings of the 11th international conference on Developments in language theory
One-stack automata as acceptors of context-free languages
Journal of Computing Sciences in Colleges
| Hi-index | 0.01 |
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA, OVPA and MPDA, which have all been defined and studied in the past. Multi-stack pushdown automata, MPDA, have ordered stacks with pop access restricted to the stack-top of the first non-empty stack. The membership for MPDAs is known to be in NSPACE(n ) and in P. We show that the P-time algorithm can be implemented in the complexity class LogCFL; thus membership for MPDAs is LogCFL-complete. It follows that membership testing for ordered visibly pushdown automata OVPA is also in LogCFL. The membership problem for multi-stack visibly pushdown automata, MVPA, is known to be NP-complete. However, many applications focus on MVPA with O (1) phases. We show that for MVPA with O (1) phases, membership reduces to that in MPDAs, and so is in LogCFL.