Search

• < Previous
• 1
• 2
• Next >

Piecewise testable tree languages

This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Sigma_1 sentences if and only if its&nbsp;[&hellip;]