Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of 'deterministic factorisations'. This extra determinism property makes it usable on trees (finite or infinite). We apply our result for proving that, over trees, every monadic interpretation is equivalent to the composition of a first-order interpretation (with access to the ancestor relation) and a monadic marking. Using this remark, we give new characterisations for prefix-recognisable structures and for the Caucal hierarchy. Furthermore, we believe that this approach has other potential applications. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Colcombet, T. (2007). A combinatorial theorem for trees applications to monadic logic and infinite structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 901–912). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_77
Mendeley helps you to discover research relevant for your work.