J. P. Bell, Sufficient conditions for zero-one laws, Transactions of the American Mathematical Society, vol.354, issue.02, pp.613-630, 2002.
DOI : 10.1090/S0002-9947-01-02884-7

?. and S. N. Burris, Asymptotics for logical limit laws: when the growth of the components is in an RT class, Trans. Amer. Math. Soc, vol.355, pp.3777-3794, 2003.

?. ??, Partition Identities I. Sandwich Theorems and 0-1 Laws, Electron. J. Combin, vol.11, issue.25, p.pp, 2004.

?. ?? and . Compton, s method for proving logical limit laws, in: Model Theoretic Methods in Finite Combinatorics, Contemporary Mathematics, pp.97-128, 2011.

?. , ?. , and K. A. Yeats, Spectra and systems of equations, in: Model Theoretic Methods in Finite Combinatorics, Contemporary Mathematics, pp.43-96, 2011.

M. Bojanczyk and I. Walukiewicz, Forest algebras, in: Logic and Automata: History and Perspectives, 2008.

N. Stanley and . Burris, Number Theoretic Density and Logical Limit Laws, Mathematical Surveys and Monographs, vol.86, 2001.

?. and K. A. Yeats, Sufficient conditions for a labelled 0?1 law, Discrete Math, Theor. Comput. Sci, vol.10, issue.1, pp.147-156, 2008.

K. J. Compton, A logical approach to asymptotic combinatorics I. First order properties, Advances in Mathematics, vol.65, issue.1, pp.65-96, 1987.
DOI : 10.1016/0001-8708(87)90019-3

F. Gecseg and M. Steinby, Tree automata, in: Handbook of Formal Languages, 1997.

A. R. Woods, Coloring rules for finite trees, and probabilities of monadic second order sentences, Random Structures and Algorithms, vol.10, issue.4, pp.453-485, 1997.
DOI : 10.1002/(SICI)1098-2418(199707)10:4<453::AID-RSA3>3.0.CO;2-T