Similar Items: Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
- Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories
- Visibly Tree Automata with Memory and Constraints
- Global Numerical Constraints on Trees
- A decidable characterization of locally testable tree languages
- Model Checking Flat Freeze LTL on One-Counter Automata
- Deciding the value 1 problem for probabilistic leaktight automata