Similar Items: A decidable characterization of locally testable tree languages
- On Separation by Locally Testable and Locally Threshold Testable Languages
- Piecewise testable tree languages
- The height of piecewise-testable languages and the complexity of the logic of subwords
- Partially Ordered Automata and Piecewise Testability
- Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
- Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable