@article{lmcs:4850,
    title      = {The height of piecewise-testable languages and the complexity of the logic of subwords},
    author     = {Prateek Karandikar and Philippe Schnoebelen},
    url        = {https://lmcs.episciences.org/4850},
    doi        = {10.23638/LMCS-15(2:6)2019},
    journal    = {Logical Methods in Computer Science},
    issn       = {1860-5974},
    volume     = {Volume 15, Issue 2},
    eid        = 6,
    year       = {2019},
    month      = {Apr},
    keywords   = {Computer Science - Logic in Computer Science, Computer Science - Formal Languages and Automata Theory, F.4.1, F.4.3, F.3.1},
}