Comparing the succinctness of monadic query languages over finite trees
and
RAIRO-Theor. Inf. Appl., 38 4 (2004) 343-373
Published online: 15 October 2004
DOI: 10.1051/ita:2004017
