Comparing the succinctness of monadic query languages over finite trees. Grohe, M. & Schweikardt, N. RAIRO Theor. Informatics Appl., 38(4):343–373, 2004.
Comparing the succinctness of monadic query languages over finite trees [link]Paper  doi  bibtex   
@article{DBLP:journals/ita/GroheS04,
  author    = {Martin Grohe and
               Nicole Schweikardt},
  title     = {Comparing the succinctness of monadic query languages over finite
               trees},
  journal   = {{RAIRO} Theor. Informatics Appl.},
  volume    = {38},
  number    = {4},
  pages     = {343--373},
  year      = {2004},
  url       = {https://doi.org/10.1051/ita:2004017},
  doi       = {10.1051/ita:2004017},
  timestamp = {Mon, 25 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ita/GroheS04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0