, volume 39 of Colloquia Mathematica Societatis Janos Bolyal, pages 259 - 272 . North-Holland, 1985 . Thomas Place . Separating Regular Languages with Two Quantifier Alternations. Unpublished, a preliminary ... version can be found at https://arxiv.org/abs/1707.03295, 2018 . Thomas Place , Lorijn van Rooijen, and Marc Zeitoun . Separating Regular Languages by Locally Testable and Locally Threshold Testable
Computer Science, pages 348 - 359 . Springer, 1995 . Jean-Éric Pin and Pascal Weil . Polynomial closure and unambiguous product . Theory of Computing Systems , 30 ( 4 ): 383 - 422 , 1997 . Thomas Place ... . Thomas Place . Separating regular languages with two quantifiers alternations. Unpublished, a preliminary version can be found at https://arxiv.org/abs/1707.03295, 2018 . Thomas Place , Lorijn van Rooijen
. Thomas Place. Separating regular languages with two quantifiers alternations. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS?15), pages 202?213, 2015. Thomas Place, Lorijn van ... , MFCS?13, pages 729?740, 2013. Thomas Place, Lorijn van Rooijen, and Marc Zeitoun. Separating regular languages by locally testable and locally threshold testable languages. Logical Methods in Computer
A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in...