16
MSO and Regular Tree
Languages
•
Theorem
A set of trees is definable in MSO
iff it is regular
•
•
Proof: almost identical to Buchi’s theorem
•
•
What are star-free regular tree languages ?