@inproceedings{Zetzsche:2018:SPT:3209108.3209201,
    Address = {New York, NY, USA},
    Author = {Zetzsche, Georg},
    BookTitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science},
    File = {p929-Zetzsche (0) - a - a - a.pdf},
    ISBN = {978-1-4503-5583-4},
    Keywords = {downward closures, piecewise testable languages, separability, well-quasi-orderings, citesme!},
    Location = {Oxford, United Kingdom},
    Pages = {929--938},
    Publisher = {ACM},
    Series = {LICS '18},
    Title = {Separability by Piecewise Testable Languages and Downward Closures Beyond Subwords},
    URL = {http://doi.acm.org/10.1145/3209108.3209201},
    Year = {2018},
    acmid = {3209201},
    bdsk-url-1 = {http://doi.acm.org/10.1145/3209108.3209201},
    bdsk-url-2 = {https://doi.org/10.1145/3209108.3209201},
    date-added = {2018-07-14 11:22:56 +0000},
    date-modified = {2018-07-14 11:23:11 +0000},
    numpages = {10},
    doi = {10.1145/3209108.3209201}
}

@inproceedings{Zetzsche:2018:SPT:3209108.3209201, Address = {New York, NY, USA}, Author = {Zetzsche, Georg}, BookTitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science}, File = {p929-Zetzsche (0) - a - a - a.pdf}, ISBN = {978-1-4503-5583-4}, Keywords = {downward closures, piecewise testable languages, separability, well-quasi-orderings, citesme!}, Location = {Oxford, United Kingdom}, Pages = {929--938}, Publisher = {ACM}, Series = {LICS '18}, Title = {Separability by Piecewise Testable Languages and Downward Closures Beyond Subwords}, URL = {http://doi.acm.org/10.1145/3209108.3209201}, Year = {2018}, acmid = {3209201}, bdsk-url-1 = {http://doi.acm.org/10.1145/3209108.3209201}, bdsk-url-2 = {https://doi.org/10.1145/3209108.3209201}, date-added = {2018-07-14 11:22:56 +0000}, date-modified = {2018-07-14 11:23:11 +0000}, numpages = {10}, doi = {10.1145/3209108.3209201} }