Is the following problem decidable? If so, what's the best algorithm known?
Instance: a deterministic pushdown automaton $A$
Question: Does there exist (i) some partition of the alphabet into push, pop, and level symbols and (ii) a visibly pushdown automaton that recognizes the language accepted by $A$?