Similar Items: The height of piecewise-testable languages and the complexity of the logic of subwords
- Piecewise testable tree languages
- Partially Ordered Automata and Piecewise Testability
- On Separation by Locally Testable and Locally Threshold Testable Languages
- A decidable characterization of locally testable tree languages
- Existential Definability over the Subword Ordering
- Piecewise deterministic sampling with splitting schemes