@inproceedings{boichut_et_al:LIPIcs:2013:4058,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: rewriting systems, non-regular approximations, logic programming, tree languages, descendants},
    Author = {Boichut, Yohan and Chabin, Jacques and R{\'e}ty, Pierre},
    BookTitle = {24th International Conference on Rewriting Techniques and Applications (RTA 2013)},
    Editor = {van Raamsdonk, Femke},
    File = {Over-approximating Descendants by Synchronized Tree Languages - Boichut, Chabin, Réty (0) (0) - a - a - e.pdf},
    ISBN = {978-3-939897-53-8},
    ISSN = {1868-8969},
    Keywords = {readme},
    Pages = {128--142},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{Over-approximating Descendants by Synchronized Tree Languages}},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4058},
    Volume = {21},
    Year = {2013},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2013/4058},
    bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.RTA.2013.128},
    date-added = {2015-06-22 12:12:01 +0000},
    date-modified = {2015-06-22 12:12:45 +0000},
    file-2 = {Over-approximating Descendants by Synchronized Tree Languages - Boichut, Chabin, Réty (1) (0) - a - a - e.pdf},
    urn = {urn:nbn:de:0030-drops-40580},
    doi = {10.4230/LIPIcs.RTA.2013.128}
}

@inproceedings{boichut_et_al:LIPIcs:2013:4058, Address = {Dagstuhl, Germany}, Annote = {Keywords: rewriting systems, non-regular approximations, logic programming, tree languages, descendants}, Author = {Boichut, Yohan and Chabin, Jacques and R{\'e}ty, Pierre}, BookTitle = {24th International Conference on Rewriting Techniques and Applications (RTA 2013)}, Editor = {van Raamsdonk, Femke}, File = {Over-approximating Descendants by Synchronized Tree Languages - Boichut, Chabin, Réty (0) (0) - a - a - e.pdf}, ISBN = {978-3-939897-53-8}, ISSN = {1868-8969}, Keywords = {readme}, Pages = {128--142}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{Over-approximating Descendants by Synchronized Tree Languages}}, URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4058}, Volume = {21}, Year = {2013}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2013/4058}, bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.RTA.2013.128}, date-added = {2015-06-22 12:12:01 +0000}, date-modified = {2015-06-22 12:12:45 +0000}, file-2 = {Over-approximating Descendants by Synchronized Tree Languages - Boichut, Chabin, Réty (1) (0) - a - a - e.pdf}, urn = {urn:nbn:de:0030-drops-40580}, doi = {10.4230/LIPIcs.RTA.2013.128} }