The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Input-driven languages are in log n depth
Information Processing Letters
Some subclasses of context-free languages in NC1
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
Nondeterministic NC1 computation
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
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
Pebbling Moutain Ranges and its Application of DCFL-Recognition
Proceedings of the 7th Colloquium on Automata, Languages and Programming
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
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Synchronization of Regular Automata
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Synchronization of pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Height-deterministic pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
Visibly pushdown languages properly generalize regular languages and are properly contained in deterministic context-free languages. The complexity of their membership problem is equivalent to that of regular languages. However, the corresponding counting problem - computing the number of accepting paths in a visibly pushdown automaton - could be harder than counting paths in a non-deterministic finite automaton: it is only known to be in LogDCFL. We investigate the membership and counting problems for generalizations of visibly pushdown automata, defined using the notion of height-determinism. We show that, when the stack-height of a given pushdown automaton can be computed using a finite transducer, both problems have the same complexity as for visibly pushdown languages. We also show that when allowing pushdown transducers instead of finite-state ones, both problems become LogDCFL-complete; this uses the fact that pushdown transducers are sufficient to compute the stack heights of all real-time height-deterministic pushdown automata, and yields a candidate arithmetization of LogDCFL that is no harder than LogDCFL (our main result).