Skip to Main content Skip to Navigation
Conference papers

On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata

Abstract : While visibly pushdown languages properly generalise 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 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 generalisations of visibly pushdown automata, defined using the notion of height-determinism. We show that, when the stack-height of a given pda 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).
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Antoine Meyer Connect in order to contact the contributor
Submitted on : Wednesday, March 21, 2012 - 1:52:41 AM
Last modification on : Saturday, November 20, 2021 - 3:49:29 AM
Long-term archiving on: : Friday, June 22, 2012 - 2:20:39 AM


Files produced by the author(s)




Nutan Limaye, Meena Mahajan, Antoine Meyer. On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata. CSR 2008, Jun 2008, Moscow, Russia. p. 240-251, ⟨10.1007/978-3-540-79709-8_25⟩. ⟨hal-00681215⟩



Record views


Files downloads