Comparing the succinctness of monadic query languages over finite treesMartin Grohe and Nicole SchweikardtRAIRO-Theor. Inf. Appl., 38 4 (2004) 343-373DOI: https://doi.org/10.1051/ita:2004017
