Similar Items: Visibly Tree Automata with Memory and Constraints
- Beyond Language Equivalence on Visibly Pushdown Automata
- Minimization of visibly pushdown automata is NP-complete
- Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
- On the Expressive Power of 2-Stack Visibly Pushdown Automata
- Data optimizations for constraint automata
- Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
