@Article{         lmcs:5409,
  Author        = "Karandikar, Prateek and Schnoebelen, Philippe",
  date-added    = "2019-05-08 11:04:16 +0200",
  date-modified = "2019-05-08 11:04:16 +0200",
  Journal       = "{Logical Methods in Computer Science}",
  Keywords      = "Computer Science - Logic in Computer Science ; Computer Science - Formal Languages and Automata Theory ; F.4.1 ; F.4.3 ; F.3.1",
  Month         = "April",
  Title         = "{The height of piecewise-testable languages and the complexity of the logic of subwords}",
  URL           = "https://lmcs.episciences.org/5409",
  Volume        = "{Volume 15, Issue 2}",
  Year          = "2019",
  bdsk-url-1    = "https://lmcs.episciences.org/5409",
  File          = "1511.01807 (0) (0) - a - a - r.pdf"
}

@Article{ lmcs:5409, Author = "Karandikar, Prateek and Schnoebelen, Philippe", date-added = "2019-05-08 11:04:16 +0200", date-modified = "2019-05-08 11:04:16 +0200", Journal = "{Logical Methods in Computer Science}", Keywords = "Computer Science - Logic in Computer Science ; Computer Science - Formal Languages and Automata Theory ; F.4.1 ; F.4.3 ; F.3.1", Month = "April", Title = "{The height of piecewise-testable languages and the complexity of the logic of subwords}", URL = "https://lmcs.episciences.org/5409", Volume = "{Volume 15, Issue 2}", Year = "2019", bdsk-url-1 = "https://lmcs.episciences.org/5409", File = "1511.01807 (0) (0) - a - a - r.pdf" }