Similar Items: On Separation by Locally Testable and Locally Threshold Testable Languages
- A decidable characterization of locally testable tree 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
- Separating Regular Languages with First-Order Logic
- Separating regular languages with two quantifier alternations