Separating regular languages with two quantifier alternations
We investigate a famous decision problem in automata theory: separation.Given a class of language C, the separation problem for C takes as input two regular languages and asks whether there exists a third one which belongs to C, includes the first one and is disjoint from the second.Typically, obtaining an algorithm for separation yields a deep und