@inproceedings{Goubault-Larrecq:Schmitz:ICALP:2016,
    Annote = {Keywords: Well-quasi-order, ideal, tree languages, first-order logic},
    Author = {Goubault-Larrecq, Jean and Schmitz, Sylvain},
    BookTitle = {Proc. of ICALP'16},
    File = {LIPIcs-ICALP-2016-97 (0) - a - a - s.pdf},
    ISBN = {978-3-95977-013-2},
    ISSN = {1868-8969},
    Pages = {97:1--97:15},
    Series = {LIPIcs},
    Title = {{Deciding Piecewise Testable Separability for Regular Tree Languages}},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6232},
    Volume = {55},
    Year = {2016},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2016/6232},
    bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.97},
    date-added = {2017-04-03 17:57:24 +0000},
    date-modified = {2019-05-17 12:07:29 +0200},
    urn = {urn:nbn:de:0030-drops-62321},
    doi = {10.4230/LIPIcs.ICALP.2016.97}
}

@inproceedings{Goubault-Larrecq:Schmitz:ICALP:2016, Annote = {Keywords: Well-quasi-order, ideal, tree languages, first-order logic}, Author = {Goubault-Larrecq, Jean and Schmitz, Sylvain}, BookTitle = {Proc. of ICALP'16}, File = {LIPIcs-ICALP-2016-97 (0) - a - a - s.pdf}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, Pages = {97:1--97:15}, Series = {LIPIcs}, Title = {{Deciding Piecewise Testable Separability for Regular Tree Languages}}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6232}, Volume = {55}, Year = {2016}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2016/6232}, bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.97}, date-added = {2017-04-03 17:57:24 +0000}, date-modified = {2019-05-17 12:07:29 +0200}, urn = {urn:nbn:de:0030-drops-62321}, doi = {10.4230/LIPIcs.ICALP.2016.97} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge