Piecewise Testable Tree Languages

This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma
₁
formulas. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Sigma
₁
formulas if and only if its syntactic monoid is J-trivial.