Similar Items: On the Expressive Power of 2-Stack Visibly Pushdown Automata
- Beyond Language Equivalence on Visibly Pushdown Automata
- Minimization of visibly pushdown automata is NP-complete
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
- On the Expressive Power of Higher-Order Pushdown Systems
- Edit Distance for Pushdown Automata
- Model Checking Probabilistic Pushdown Automata
