%0 Journal Article
%A Grohe, Martin
%A Schweikardt, Nicole
%T Comparing the succinctness of monadic query languages over finite trees
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2004
%P 343-373
%V 38
%N 4
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ita:2004017/
%R 10.1051/ita:2004017
%G en
%F ITA_2004__38_4_343_0