Some Remarks on First-Order Definable Tree Languages
Achim Blumensath · arXiv (Cornell University) · 2024
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for definability (but unfortunately no condition that is both). The main difference of our results to those from the literature is that our conditions are decidable.