A Contraction Method to Decide MSO Theories of Deterministic Trees

In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored deterministic trees. The method we propose rests on a suitable notion of indistinguishability of trees with respect to tree automata that allows us to reduce a number of instances of the acceptance problem for tree automata to decidable instances involving regular trees. We prove that such a method works effectively for a large class of trees, which is closed under noticeable operations and includes all the deterministic trees of the Caucal hierarchy obtained via unfoldings and inverse finite mappings as well as several trees outside such a hierarchy.

• Type: Conference
• Year: 2007
• Where: LICS
• Authors: Angelo Montanari, Gabriele Puppis
• Keywords: Computer Science, Contraction Method, Deterministic Trees, LICS 2007, Tree Automata