Lower bound for complexity of language emptiness checking in visibly pushdown automata?

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....

19 April 2017 8,571 0 View