Similar Items: Partially Ordered Automata and Piecewise Testability
- Piecewise testable tree languages
- The height of piecewise-testable languages and the complexity of the logic of subwords
- On Separation by Locally Testable and Locally Threshold Testable Languages
- A decidable characterization of locally testable tree languages
- Piecewise deterministic sampling with splitting schemes
- Borel-piecewise continuous reducibility for uniformization problems