@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}
}

{"_id":{"_str":"527a09625e011a4c4b0005ff"},"__v":8,"authorIDs":["545720022abc8e9f370000a8","oWamqdovFccHcFdCZ"],"author_short":["Grohe, M.","Schweikardt, N."],"bibbaseid":"grohe-schweikardt-comparingthesuccinctnessofmonadicquerylanguagesoverfinitetrees-2004","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Martin"],"propositions":[],"lastnames":["Grohe"],"suffixes":[]},{"firstnames":["Nicole"],"propositions":[],"lastnames":["Schweikardt"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/ita/GroheS04,\n author = {Martin Grohe and\n Nicole Schweikardt},\n title = {Comparing the succinctness of monadic query languages over finite\n trees},\n journal = {{RAIRO} Theor. Informatics Appl.},\n volume = {38},\n number = {4},\n pages = {343--373},\n year = {2004},\n url = {https://doi.org/10.1051/ita:2004017},\n doi = {10.1051/ita:2004017},\n timestamp = {Mon, 25 May 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/ita/GroheS04.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Grohe, M.","Schweikardt, N."],"key":"DBLP:journals/ita/GroheS04","id":"DBLP:journals/ita/GroheS04","bibbaseid":"grohe-schweikardt-comparingthesuccinctnessofmonadicquerylanguagesoverfinitetrees-2004","role":"author","urls":{"Paper":"https://doi.org/10.1051/ita:2004017"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://dblp.org/pers/tb2/g/Grohe:Martin","downloads":0,"keywords":[],"search_terms":["comparing","succinctness","monadic","query","languages","over","finite","trees","grohe","schweikardt"],"title":"Comparing the succinctness of monadic query languages over finite trees","year":2004,"dataSources":["jS7oF7ycnJjCpQRs7"]}