P-hardness of the emptiness problem for visibly pushdown languages

Authors:
Martin Lange
Affiliations:
Dept. of Elect. Eng. and Computer Science, University of Kassel, Germany
Venue:
Information Processing Letters
Year:
2011

Citing 5
Cited 0

Parsing theory. Vol. 1: languages and parsing

Parsing theory. Vol. 1: languages and parsing
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Pebbling Moutain Ranges and its Application of DCFL-Recognition

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

Visibly pushdown languages form a subclass of the context-free languages which is appealing because of its nice algorithmic and closure properties. Here we show that the emptiness problem for this class is not any easier than the emptiness problem for context-free languages, namely hard for deterministic polynomial time. The proof consists of a reduction from the alternating graph reachability problem.