What is the best known lower bound for the complexity of language emptiness checking in visibly pushdown automata? Alur in [1] gave O(n^3) as upper bound.
[1] Rajeev Alur and P. Madhusudan. 2004. Visibly pushdown languages. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (STOC '04). ACM, New York, NY, USA, 202-211. DOI: http://dx.doi.org/10.1145/1007352.1007390