The following pages link to Piecewise testable tree languages (Q3166216):
Displayed 13 items.
- Fragments of first-order logic over infinite words (Q537914) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Automata on finite trees (Q2074209) (← links)
- Algebra for trees (Q2074223) (← links)
- EF+EX Forest Algebras (Q2947153) (← links)
- A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Characterization of Logics over Ranked Tree Languages (Q3540193) (← links)
- (Q4989409) (← links)
- (Q5376657) (← links)
- Weak Separation Problem for Tree Languages (Q5859635) (← links)
- On Arch Factorization and Subword Universality for Words and Compressed Words (Q6134881) (← links)
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages (Q6137830) (← links)