Partially supported by the Esprit Working Group 22457- CCL II Draft
Abstract:
We investigate the question whether the well-known correspondence between tree automata and the weak second order logic of two successor functions (WS2S) can be extended to tree automata with tests. Our rst insight is that there is no generalization of tree automata with tests that has a decidable emptiness problem and that is equivalent to the full class of formulae in some extension of WS2S, at least not when we are asking for an conservative extension of the classical correspondence between WS2S and tree automata to tree automata with tests. As a consequence we can extend the correspondence between tree automata and WS2S to automata with tests only when we admit a restriction of the class of formulae. We present a logic, called WS2Sy, and a restriction of the class of
Citations
| 82 | A Variant of a Recursively Unsolvable Problem – Post - 1946 |
| 42 | Encompassment properties and automata with constraints – Caron, Coquid'e, et al. - 1993 |
| 31 | Decidability of second-order theories and automata on in trees – Rabin - 1969 |
| 20 | unknown title – Comon, Dauchet - 1997 |
| 16 | Equality and disequality constraints on brother terms in tree automata – Bogaert, Tison - 2000 |
| 11 | Grid structures and undecidable constraint theories – Seynhaeve, Tommasi, et al. - 1997 |
| 5 | Transformations de noyaux reconnaissables d'arbres. For^ets RATEG. PhD thesis, Laboratoire d'Informatique Fondamentale de Lille, Universite Lille 1, Villeneuve d'Asq – Mongy - 1981 |
| 4 | Comon, Jean-Luc Coquide, Max Dauchet, and Florent Jacquemard. Pumping, cleaning and symbolic constraints solving – Caron, Hubert - 1994 |
| 1 | Reecriture et Contraintes : Resultats de Decidabilite et d'Indecidabilite – Automates - 1999 |
