@Unpublished{     goubaultlarrecq:schmitz:hal-01276119,
  Author        = "Goubault-Larrecq, Jean and Schmitz, Sylvain",
  date-added    = "2016-03-05 11:06:09 +0000",
  date-modified = "2016-06-07 15:29:13 +0000",
  hal_id        = "hal-01276119",
  hal_version   = "v1",
  Keywords      = "well-quasi-order ; ideal ; tree languages ; first-order logic",
  Month         = "February",
  Note          = "Submitted",
  PDF           = "https://hal.inria.fr/hal-01276119/file/lipics.pdf",
  Title         = "Deciding Piecewise Testable Separability for Regular Tree Languages",
  URL           = "https://hal.inria.fr/hal-01276119",
  Year          = "2016",
  bdsk-url-1    = "https://hal.inria.fr/hal-01276119",
  File          = "Deciding Piecewise Testable Separability for Regular Tree Languages - Goubault-Larrecq, Schmitz (0) (0) - a - a - s.pdf"
}

@Unpublished{ goubaultlarrecq:schmitz:hal-01276119, Author = "Goubault-Larrecq, Jean and Schmitz, Sylvain", date-added = "2016-03-05 11:06:09 +0000", date-modified = "2016-06-07 15:29:13 +0000", hal_id = "hal-01276119", hal_version = "v1", Keywords = "well-quasi-order ; ideal ; tree languages ; first-order logic", Month = "February", Note = "Submitted", PDF = "https://hal.inria.fr/hal-01276119/file/lipics.pdf", Title = "Deciding Piecewise Testable Separability for Regular Tree Languages", URL = "https://hal.inria.fr/hal-01276119", Year = "2016", bdsk-url-1 = "https://hal.inria.fr/hal-01276119", File = "Deciding Piecewise Testable Separability for Regular Tree Languages - Goubault-Larrecq, Schmitz (0) (0) - a - a - s.pdf" }